Crux and Long Cycles in Graphs
From MaRDI portal
Recommendations
- Long cycles in critical graphs
- scientific article; zbMATH DE number 3979098
- Long cycles in certain graphs of large degree
- scientific article; zbMATH DE number 4150204
- 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
Cites work
- A proof of Mader's conjecture on large clique subdivisions in \(C_4\)-free graphs
- A solution to Erdős and Hajnal’s odd cycle problem
- A stability result for the cube edge isoperimetric inequality
- An extremal problem for subdivisions ofK?5
- Asymptotics in percolation on high-girth expanders
- Clique immersion in graphs without a fixed bipartite graph
- Cycle lengths in expanding graphs
- Dirac's theorem for random graphs
- Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at leastk
- Expander graphs and their applications
- Expanders -- how to find them, and what to find in them
- Expansion in supercritical random subgraphs of the hypercube and its consequences
- Extremal density for sparse minors and subdivisions
- Hamiltonian circuits in random graphs
- scientific article; zbMATH DE number 3878974 (Why is no real title available?)
- scientific article; zbMATH DE number 3922707 (Why is no real title available?)
- scientific article; zbMATH DE number 3232670 (Why is no real title available?)
- Hypercube percolation
- Largest random component of a k-cube
- Limit distribution for the existence of Hamiltonian cycles in a random graph
- Long cycles in locally expanding graphs, with applications
- Long cycles in random subgraphs of graphs with large minimum degree
- 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
- Long paths and cycles in subgraphs of the cube
- Long paths and Hamiltonicity in random graphs
- Nested cycles with no geometric crossings
- On a problem of K. Zarankiewicz
- On large matchings and cycles in sparse random graphs
- Optimal numberings and isoperimetric problems on graphs
- Paths and cycles in random subgraphs of graphs with large minimum degree
- Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
- Robust Hamiltonicity of Dirac graphs
- Some Theorems on Abstract Graphs
- The longest path in a random graph
- The number of edges in a subgraph of a Hamming graph
- Topological Cliques in Graphs
- Topological cliques in graphs II
- Über ein Problem von K. Zarankiewicz
Cited in
(15)- Long paths and cycles in subgraphs of the cube
- Long cycles in critical graphs
- 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
- Crux and long cycles in graphs
- Towards the Erdős-Gallai cycle decomposition conjecture
- Separating path systems of almost linear size
- Many Hamiltonian subsets in large graphs with given density
- Crux, space constraints and subdivisions
- Nearly Hamilton cycles in sublinear expanders and applications
- Essentially tight bounds for rainbow cycles in proper edge-colourings
- Crux, space constraints and subdivisions (extended abstract)
- Embedding clique subdivisions via crux
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)
