On Ks, t-minors in graphs with given average degree, II

@article{Kostochka2012OnKT,
  title={On Ks, t-minors in graphs with given average degree, II},
  author={Alexandr V. Kostochka and Noah Prince},
  journal={Discret. Math.},
  year={2012},
  volume={312},
  pages={3517-3522}
}
View via Publisher
faculty.math.illinois.edu
11 Citations
Highly Influential Citations
3
Background Citations
5
Methods Citations
2
Results Citations
1

Figures from this paper

11 Citations

Citation Type

Citation Type

Ks,t Minors in (s+t) ‐ Chromatic Graphs, II
TLDR
It is shown that the statement holds already for much smaller t, namely, for t>Cslogs3, and confirmed a partial case of the corresponding conjecture by Woodall and Seymour.
Defective Colouring of Graphs Excluding A Subgraph or Minor
TLDR
A common generalisation of these theorems with a weaker assumption about excluded subgraphs is proved, which leads to new defective colouring results for several graph classes, including graphs with linear crossing number, graphs with given thickness, and graphs excluding a complete bipartite graph as a topological minor.
Forcing a sparse minor
  • B. Reed, D. Wood
  • Mathematics
    Combinatorics, Probability and Computing
  • 2015
TLDR
The main result, which complements the result of Myers and Thomason, states that if H has t vertices and average degree d at least some absolute constant, then f(H) ≤ 3.895\sqrt{\ln d}\,t$ .
Average Degree Conditions Forcing a Minor
TLDR
This work strengthens (under certain conditions) a recent result by Reed and Wood, giving better bounds on the average degree required to force an arbitrary graph as a minor when $H$ is a sparse graph with many high degree vertices.
Disproof of a Conjecture by Woodall
In 2001, in a survey article [26] about list coloring, Woodall conjectured that for every pair of integers s, t ≥ 1, all graphs without a Ks,t-minor are (s + t − 1)-choosable. In this note we refute…
The extremal function for Petersen minors
A Lower Bound on the Average Degree Forcing a Minor
TLDR
It is shown that for sufficiently large graphs and for t ≥ d, there is a graph G such that almost every graph H with t vertices and average degree $H$ is not a minor of $G$, where $\lambda=0.63817\dots$ is an explicitly defined constant.
The extremal function for structured sparse minors
Let c(H) be the smallest value for which e(G)/|G| > c(H) implies H is a minor of G. We show a new upper bound on c(H), which improves previous bounds for graphs with a vertex partition where some…
On Treewidth and Graph Minors
TLDR
This thesis determines exactly the treewidth of the line graph of a complete graph, up to lower order terms in general, and exactly whenever the complete multipartite graph is regular, and generalises a result by Lucena.
Hadwiger's Conjecture
  • P. Seymour
  • 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…
...
1
2
...

References

SHOWING 1-10 OF 23 REFERENCES
On Ks,t minors in (s+t)‐chromatic graphs
TLDR
It is proved that for each fixed s and sufficiently large t, every graph with chromatic number s+t has a K∗ s,t minor.
On K s,t minors in (s+t)-chromatic graphs
Let K *s, t denote the graph obtained from the complete graph Ks+t by deleting the edges of some Kt-subgraph. We prove that for each fixed s and sufficiently large t, every graph with chromatic…
On Ks, t-minors in graphs with given average degree
The edge-density for K 2 , t minors
Let H be a graph. If G is an n-vertex simple graph that does not contain H as a minor, what is the maximum number of edges that G can have? This is at most linear in n, but the exact expression is…
The edge-density for K2, t minors
Graphs without Large Complete Minors are Quasi-Random
  • J. Myers
  • Mathematics
    Combinatorics, Probability and Computing
  • 2002
TLDR
It is shown that, if a graph G of order n and density p has no complete minor larger than would be found in a random graph G(n, p), then G is quasi-random, provided either p > 0.45631 … or κ(G) [ges ] n( log log log n)/(log log n), where 0.45731 … is an explicit constant.
Dense graphs have K3, t minors
The extremal function for unbalanced bipartite minors
Forcing unbalanced complete bipartite minors
The Extremal Function for Complete Minors
TLDR
Let c(t) be the minimum number c such that every graph G with e(G)?c|G| contracts to a complete graph Kt where ?=0.319... is an explicit constant.
...
1
2
3
...