Local Conditions for Exponentially Many Subdivisions

DOI10.1017/S0963548316000365zbMath1371.05055arXiv1612.00206OpenAlexW2559625682MaRDI QIDQ5366949

Hong Liu, Maryam Sharifzadeh, Katherine Staden

Publication date: 10 October 2017

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

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

zbMATH Keywords

distinguishable cycles

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph minors (05C83)

Related Items (1)

Proof of Komlós's conjecture on Hamiltonian subsets

Cites Work

• Unnamed Item
• Problems on cycles and colorings
• Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen
• Highly linked graphs
• Extremal connectivity for topological cliques in bipartite graphs
• Topological cliques in graphs II
• Hinreichende Bedingungen für die Existenz von Teilgraphen, die zu einem vollständigen Graphen homöomorph sind

This page was built for publication: Local Conditions for Exponentially Many Subdivisions