Subdivisions of a large clique in \(C_6\)-free graphs
From MaRDI portal
Publication:2343284
DOI10.1016/j.jctb.2014.11.004zbMath1310.05192arXiv1312.6213OpenAlexW2168817489MaRDI QIDQ2343284
Maryam Sharifzadeh, József Balogh, Hong Liu
Publication date: 4 May 2015
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.6213
Graph minors (05C83) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (3)
Proof of Komlós's conjecture on Hamiltonian subsets ⋮ Rainbow clique subdivisions ⋮ Balanced Subdivisions of a Large Clique in Graphs with High Average Degree
Cites Work
- Unnamed Item
- Unnamed Item
- Induced subdivisions in \(K_{s,s}\)-free graphs of large average degree
- Cycle lengths in sparse graphs
- Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
- \(C_ 6\)-free bipartite graphs and product representation of squares
- Topological minors in graphs of large girth
- Cycles of even length in graphs
- Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen
- Dependent random choice
- An extremal problem for subdivisions ofK?5
- Topological Cliques in Graphs
- Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
- Four-cycles in graphs without a given even cycle
- Large Topological Cliques in Graphs Without a 4-Cycle
- Topological cliques in graphs II
- On a problem of K. Zarankiewicz
This page was built for publication: Subdivisions of a large clique in \(C_6\)-free graphs
