Scott's Induced Subdivision Conjecture for Maximal Triangle-Free Graphs

DOI10.1017/S0963548312000065zbMath1247.05075arXiv1107.3491OpenAlexW1975403516WikidataQ122960550 ScholiaQ122960550MaRDI QIDQ2908125

Nicolas Bousquet, Steéphan Thomassé

Publication date: 4 September 2012

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1107.3491

zbMATH Keywords

maximal triangle free graphsgraphs with no induced subdivision

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Identifying Codes in Hereditary Classes of Graphs and VC-Dimension ⋮ Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings

Cites Work

• Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
• Bounding the vertex cover number of a hypergraph
• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• The Ramsey number R(3, t) has order of magnitude t²/log t
• Unnamed Item

This page was built for publication: Scott's Induced Subdivision Conjecture for Maximal Triangle-Free Graphs