The contraction clique number ccl(G) of a graph G is the maximal r for which G has a subcontraction to the complete graph K′. We prove that for d > 2, almost every graph of order n satisfies n((log2n)1/2+4)-1 ⩽ ccl(G) ⩽ n(log2n-d log2 log2n)1/2. This inequality implies the statement in the title
Hadwiger's conjecture states that for every graph G, chi(G) <= eta(G), where chi(G) is the chromatic...
Brooks ’ Theorem implies that if a graph has ∆ ≥ 3 and and χ> ∆, then ω = ∆+1. Borodin and Kosto...
Abstract Let G be a graph with n vertices and independence number α. Hadwiger's conjecture impl...
The contraction clique number ccl(G) of a graph G is the maximal r for which G has a subcontraction ...
AbstractConsider the following relaxation of the Hadwiger Conjecture: For each t there exists Nt suc...
The contractibility number (also known as the Hadwiger number) of a connected graph G, Z(G), is defi...
We consider a problem related to Hadwiger\u27s Conjecture. Let D=(d 1, d 2,...,d n) be a graphic seq...
The Hadwiger number eta(G) of a graph G is the largest integer n for which the complete graph K-n on...
The Hadwiger number h(G) of a graph G is the maximum size of a complete minor of G. Hadwiger's Conje...
AbstractThe Hadwiger number of a graph G = (V, E), denoted by η(G), is the maximum size of a complet...
We consider a problem related to Hadwiger\u27s Conjecture. Let D=(d(1), d(2),...,d(n)) be a graphic ...
The classical Hadwiger conjecture dating back to 1940s states that any graph of chromatic number at ...
Given a graph G, the Hadwiger number of G, denoted by h(G), is the largest integer κ such that G con...
AbstractSince χ(G)·α(G)⩾n(G), Hadwiger's conjecture implies that any graph G has the complete graph ...
The Hadwiger number h(G) of a graph G is the maximum integer f such that Kt is a minor of G. Since ξ...
Hadwiger's conjecture states that for every graph G, chi(G) <= eta(G), where chi(G) is the chromatic...
Brooks ’ Theorem implies that if a graph has ∆ ≥ 3 and and χ> ∆, then ω = ∆+1. Borodin and Kosto...
Abstract Let G be a graph with n vertices and independence number α. Hadwiger's conjecture impl...
The contraction clique number ccl(G) of a graph G is the maximal r for which G has a subcontraction ...
AbstractConsider the following relaxation of the Hadwiger Conjecture: For each t there exists Nt suc...
The contractibility number (also known as the Hadwiger number) of a connected graph G, Z(G), is defi...
We consider a problem related to Hadwiger\u27s Conjecture. Let D=(d 1, d 2,...,d n) be a graphic seq...
The Hadwiger number eta(G) of a graph G is the largest integer n for which the complete graph K-n on...
The Hadwiger number h(G) of a graph G is the maximum size of a complete minor of G. Hadwiger's Conje...
AbstractThe Hadwiger number of a graph G = (V, E), denoted by η(G), is the maximum size of a complet...
We consider a problem related to Hadwiger\u27s Conjecture. Let D=(d(1), d(2),...,d(n)) be a graphic ...
The classical Hadwiger conjecture dating back to 1940s states that any graph of chromatic number at ...
Given a graph G, the Hadwiger number of G, denoted by h(G), is the largest integer κ such that G con...
AbstractSince χ(G)·α(G)⩾n(G), Hadwiger's conjecture implies that any graph G has the complete graph ...
The Hadwiger number h(G) of a graph G is the maximum integer f such that Kt is a minor of G. Since ξ...
Hadwiger's conjecture states that for every graph G, chi(G) <= eta(G), where chi(G) is the chromatic...
Brooks ’ Theorem implies that if a graph has ∆ ≥ 3 and and χ> ∆, then ω = ∆+1. Borodin and Kosto...
Abstract Let G be a graph with n vertices and independence number α. Hadwiger's conjecture impl...
DOI
Add to ORKG