# Lower bound of the hadwiger number of graphs by their average degree

@article{Kostochka1984LowerBO, title={Lower bound of the hadwiger number of graphs by their average degree}, author={A. Kostochka}, journal={Combinatorica}, year={1984}, volume={4}, pages={307-316} }

The aim of this paper is to show that the minimum Hadwiger number of graphs with average degreek isO(k/√logk). Specially, it follows that Hadwiger’s conjecture is true for almost all graphs withn vertices, furthermore ifk is large enough then for almost all graphs withn vertices andnk edges.

#### Topics from this paper

#### 269 Citations

Hadwiger's Conjecture

- Computer Science, Mathematics
- Open Problems in Mathematics
- 2016

This is a survey of Hadwiger’s conjecture from 1943, that for all t ≥ 0, every graph either can be t-coloured, or has a subgraph that can be contracted to the complete graph on t + 1 vertices. This… Expand

Minor Extremal Problems Using Turan Graphs

- Mathematics
- 2007

The extremal number ex(n;MKp) denotes the maximum number of edges of a graph of order n not containing a complete graph Kp as a minor. In this paper we find a lower bound for this extremal number

List Colouring Squares of Planar Graphs

- Mathematics, Computer Science
- Electron. Notes Discret. Math.
- 2007

It is shown that the chromatic number of the square of every planar graph G with maximum degree Δ ⩾ 8 is at most ⌈ 3 2 Δ ⌉ + 1, and indeed this is true for the list Chromatic number. Expand

Dense Minors In Graphs Of Large Girth

- Mathematics, Computer Science
- Comb.
- 2004

We show that a graph of girth greater than 6 log k+3 and minimum degree at least 3 has a minor of minimum degree greater than k. This is best possible up to a factor of at most 9/4. As a corollary,… Expand

Cycles of Given Size in a Dense Graph

- Computer Science, Mathematics
- SIAM J. Discret. Math.
- 2015

It is shown that every graph with average degree at least $\frac{4}{3}kr$ contains $k$ vertex disjoint cycles, each of order at least $r$ as long as $k \geq 6$. Expand

Rank-width and tree-width of H-minor-free graphs

- Mathematics, Computer Science
- Eur. J. Comb.
- 2010

It is proved that for any fixed r>=2, the tree-width of graphs not containing K"r as a topological minor is bounded by a linear function of their rank-width. Expand

Disproof of the List Hadwiger Conjecture

- Mathematics, Computer Science
- Electron. J. Comb.
- 2011

The List Hadwiger Conjecture is disproved by constructing a-minor-free graph that is not $4t-choosable for every integer $t\geq 1$. Expand

Minors in graphs of large girth

- Computer Science, Mathematics
- Random Struct. Algorithms
- 2003

The case g = 5 of the result implies Hadwiger's conjecture for C4-free graphs of sufficiently large chromatic number and a well-known conjecture about the minimal order of graphs of given minimum degree and large girth is implied. Expand

Complete minors in digraphs with given dichromatic number

- Mathematics
- 2021

The dichromatic number ~ χ(D) of a digraph D is the smallest k for which it admits a k-coloring where every color class induces an acyclic subgraph. Inspired by Hadwiger’s conjecture for undirected… Expand

Constructing dense graphs with sublinear Hadwiger number

- Mathematics, Computer Science
- ArXiv
- 2011

This work shows how to explicitly construct dense graphs for which the size of the largest clique minor is sublinear in the number of vertices using blow-ups of small graphs with this property, which leads to the study of a fractional variant of the cliqueMinor number. Expand

#### References

SHOWING 1-10 OF 17 REFERENCES

Contractions of graphs: A theorem of ore and an extremal problem

- Computer Science, Mathematics
- Discret. Math.
- 1978

An elementary proof is given of a theorem of Ore about this invariant about the maximum order of a connected graph onto which G is contractible and the extremal problem of finding the maximum Z(G) over all graphs G of a given order and regularity degree is solved. Expand

Probabilistic Methods in Combinatorics

- Mathematics
- 1974

In 1947 Paul Erdős [8] began what is now called the probabilistic method. He showed that if \(\left( {\begin{array}{*{20}{c}} n \\ k \\ \end{array} } \right){{2}^{{1 - \left( {\begin{array}{*{20}{c}}… Expand

Probabilistie methods in combinatorics

- Probabilistie methods in combinatorics
- 1974

On the edge number of graphs with no greater Hadwiger number than 4, Prikladnaja matematika i programmirovanije

- On the edge number of graphs with no greater Hadwiger number than 4, Prikladnaja matematika i programmirovanije
- 1972

KoRsrmNov, On the chromatic number of graphs on n vertices (in Russian), Metody diskretnogo anatiza v teorii bulevyh fimkcij i skhem

- W. MADER, Homomorphies/itze fOr Graphen, Math. Atmalen,
- 1968

Math. Atmalen

- Math. Atmalen
- 1968

Math. Annalen

- Math. Annalen
- 1964