Crux and Long Cycles in Graphs
From MaRDI portal
Publication:5058129
DOI10.1137/21M143488XMaRDI QIDQ5058129FDOQ5058129
Authors: John Haslegrave, Jie Hu, Hong Liu, Bingyu Luan, Guanghui Wang, Jaehoon 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
Recommendations
- Long cycles in critical graphs
- scientific article; zbMATH DE number 3979098
- Long cycles in certain graphs of large degree
- scientific article
- Long cycles and paths in distance graphs
- scientific article; zbMATH DE number 3875321
- Long cycles in bipartite graphs
- Graphs with almost all edges in long cycles
- Long dominating cycles in graphs
- Long dominating cycles in graphs
Extremal problems in graph theory (05C35) Distance in graphs (05C12) Paths and cycles (05C38) Expander graphs (05C48)
Cites Work
- Long cycles in locally expanding graphs, with applications
- Expander graphs and their applications
- Some Theorems on Abstract Graphs
- Über ein Problem von K. Zarankiewicz
- On a problem of K. Zarankiewicz
- Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
- Dirac's theorem for random graphs
- Topological cliques in graphs II
- Optimal numberings and isoperimetric problems on graphs
- Title not available (Why is that?)
- Hamiltonian circuits in random graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Limit distribution for the existence of Hamiltonian cycles in a random graph
- Largest random component of a k-cube
- The longest path in a random graph
- A stability result for the cube edge isoperimetric inequality
- Long paths and cycles in random subgraphs of \(\mathcal{H}\)-free graphs
- Long paths and cycles in random subgraphs of graphs with large minimum degree
- Hypercube percolation
- Long cycles in random subgraphs of graphs with large minimum degree
- Cycle lengths in expanding graphs
- Topological Cliques in Graphs
- Robust Hamiltonicity of Dirac graphs
- On large matchings and cycles in sparse random graphs
- An extremal problem for subdivisions ofK?5
- A solution to Erdős and Hajnal’s odd cycle problem
- Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at leastk
- Extremal density for sparse minors and subdivisions
- The number of edges in a subgraph of a Hamming graph
- Proof of Komlós's conjecture on Hamiltonian subsets
- A proof of Mader's conjecture on large clique subdivisions in \(C_4\)-free graphs
- Paths and cycles in random subgraphs of graphs with large minimum degree
- Asymptotics in percolation on high-girth expanders
- Long paths and Hamiltonicity in random graphs
- Expanders -- how to find them, and what to find in them
- Expansion in supercritical random subgraphs of the hypercube and its consequences
- Clique immersion in graphs without a fixed bipartite graph
- Long paths and cycles in subgraphs of the cube
- Nested cycles with no geometric crossings
Cited In (10)
- Long paths and cycles in subgraphs of the cube
- Separating path systems of almost linear size
- Disjoint isomorphic balanced clique subdivisions
- How to build a pillar: a proof of Thomassen's conjecture
- Long paths in heterogeneous random subgraphs of graphs with large minimum degree
- Towards the Erdős-Gallai cycle decomposition conjecture
- Many Hamiltonian subsets in large graphs with given density
- Crux, space constraints and subdivisions
- Towards the Erdős-Gallai cycle decomposition conjecture
- Long cycles in critical graphs
This page was built for publication: Crux and Long Cycles in Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5058129)
