Nested cycles with no geometric crossings

DOI10.1090/bproc/107zbMath1482.05172arXiv2104.04810OpenAlexW4210756586MaRDI QIDQ5030154

Hong Liu, Irene Gil Fernández, Younjin Kim, Jae-Hoon Kim

Publication date: 16 February 2022

Published in: Proceedings of the American Mathematical Society, Series B (Search for Journal in Brave)

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

zbMATH Keywords

edge-disjoint cyclessublinear expanders

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Expander graphs (05C48)

Related Items (5)

Well-mixing vertices and almost expanders ⋮ Crux and Long Cycles in Graphs ⋮ Disjoint isomorphic balanced clique subdivisions ⋮ How to build a pillar: a proof of Thomassen's conjecture ⋮ Towards the Erdős-Gallai cycle decomposition conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partition of graphs with condition on the connectivity and minimum degree
• Partitions of graphs with high minimum degree or connectivity.
• Proof of Komlós's conjecture on Hamiltonian subsets
• Proof of a conjecture of Bollobás on nested cycles
• Vertex-disjoint cycles of the same length
• Graph decomposition with constraints on the connectivity and minimum degree
• A Note on Vertex-Disjoint Cycles
• Topological cliques in graphs II
• Extremal density for sparse minors and subdivisions
• A proof of Mader's conjecture on large clique subdivisions in C4-free graphs
• On the maximal number of independent circuits in a graph

This page was built for publication: Nested cycles with no geometric crossings