Crux and Long Cycles in Graphs
From MaRDI portal
Publication:5058129
DOI10.1137/21M143488XMaRDI QIDQ5058129
Bingyu Luan, Guang-Hui Wang, Jie Hu, John Haslegrave, Hong Liu, Jae-Hoon Kim
Publication date: 2 December 2022
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.02061
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Distance in graphs (05C12) Expander graphs (05C48)
Related Items (4)
Disjoint isomorphic balanced clique subdivisions ⋮ Long paths in heterogeneous random subgraphs of graphs with large minimum degree ⋮ 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
- Long paths and cycles in random subgraphs of \(\mathcal{H}\)-free graphs
- Hypercube percolation
- Limit distribution for the existence of Hamiltonian cycles in a random graph
- On large matchings and cycles in sparse random graphs
- The longest path in a random graph
- Largest random component of a k-cube
- Hamiltonian circuits in random graphs
- Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
- The number of edges in a subgraph of a Hamming graph
- A stability result for the cube edge isoperimetric inequality
- Proof of Komlós's conjecture on Hamiltonian subsets
- Paths and cycles in random subgraphs of graphs with large minimum degree
- Cycle lengths in expanding graphs
- Expansion in supercritical random subgraphs of the hypercube and its consequences
- Clique immersion in graphs without a fixed bipartite graph
- Long cycles in locally expanding graphs, with applications
- Long paths and cycles in subgraphs of the cube
- Dirac's theorem for random graphs
- Über ein Problem von K. Zarankiewicz
- Expander graphs and their applications
- An extremal problem for subdivisions ofK?5
- Topological Cliques in Graphs
- Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at leastk
- Topological cliques in graphs II
- Long paths and cycles in random subgraphs of graphs with large minimum degree
- Nested cycles with no geometric crossings
- Extremal density for sparse minors and subdivisions
- Asymptotics in percolation on high‐girth expanders
- Expanders – how to find them, and what to find in them
- Long cycles in random subgraphs of graphs with large minimum degree
- Long paths and Hamiltonicity in random graphs
- A proof of Mader's conjecture on large clique subdivisions in C4-free graphs
- Robust Hamiltonicity of Dirac graphs
- Optimal numberings and isoperimetric problems on graphs
- Some Theorems on Abstract Graphs
- On a problem of K. Zarankiewicz
- A solution to Erdős and Hajnal’s odd cycle problem
This page was built for publication: Crux and Long Cycles in Graphs
