Proper minor-closed families are small
From MaRDI portal
Publication:2498744
DOI10.1016/j.jctb.2006.01.006zbMath1093.05065OpenAlexW2142101067MaRDI QIDQ2498744
Serguei Norine, Paul Wollan, Robin Thomas, P. D. Seymour
Publication date: 16 August 2006
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2006.01.006
Related Items (38)
The Early Evolution of the Random Graph Process in Planar Graphs and Related Classes ⋮ Classes of graphs embeddable in order-dependent surfaces ⋮ Subgraph densities in a surface ⋮ Tree densities in sparse graph classes ⋮ Number of Cliques in Graphs with a Forbidden Subdivision ⋮ Twin-width II: small classes ⋮ Cliques in graphs excluding a complete graph minor ⋮ Asymptotic Properties of Some Minor-Closed Classes of Graphs ⋮ On the number of cliques in graphs with a forbidden minor ⋮ A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three ⋮ Random graphs from a weighted minor-closed class ⋮ Graph classes with given 3-connected components: asymptotic counting and critical phenomena ⋮ Locally bounded coverings and factorial properties of graphs ⋮ Unprovability threshold for the planar graph minor theorem ⋮ On factorial properties of chordal bipartite graphs ⋮ Weakly distinguishing graph polynomials on addable properties ⋮ On the maximum number of cliques in a graph embedded in a surface ⋮ A polynomial-time algorithm to compute Turaev-Viro invariants \(\mathrm{TV}_{4,q}\) of 3-manifolds with bounded first Betti number ⋮ On the purity of minor-closed classes of graphs ⋮ Implicit representations and factorial properties of graphs ⋮ Random graphs on surfaces ⋮ Random Graphs from a Minor-Closed Class ⋮ Logical limit laws for minor-closed classes of graphs ⋮ Random graphs containing few disjoint excluded minors ⋮ Small graph classes and bounded expansion ⋮ Boundary properties of graphs for algorithmic graph problems ⋮ Growth constants of minor-closed classes of graphs ⋮ The structure and the number of \(P_7\)-free bipartite graphs ⋮ A Separator Theorem for String Graphs and its Applications ⋮ The structure and the number of \(P_7\)-free bipartite graphs ⋮ On the maximum number of cliques in a graph ⋮ Exact unprovability results for compound well-quasi-ordered combinatorial classes ⋮ Subcritical Graph Classes Containing All Planar Graphs ⋮ Boundary Properties of Factorial Classes of Graphs ⋮ Short Labels by Traversal and Jumping ⋮ Parameterized complexity of the maximum independent set problem and the speed of hereditary properties ⋮ On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion ⋮ Counting cliques in 1-planar graphs
Cites Work
This page was built for publication: Proper minor-closed families are small
