Finding any given 2‐factor in sparse pseudorandom graphs efficiently
From MaRDI portal
Publication:6055382
DOI10.1002/jgt.22576zbMath1521.05183OpenAlexW3023439304MaRDI QIDQ6055382
Patrick Morris, Yoshiharu Kohayakawa, Yury Person, Jie Han
Publication date: 29 September 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.22576
Related Items (2)
Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Triangle factors in sparse pseudo-random graphs
- Powers of Hamilton cycles in pseudorandom graphs
- Turán's theorem for pseudo-random graphs
- An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
- Explicit construction of linear sized tolerant networks
- Ramanujan graphs
- Explicit Ramsey graphs and orthonormal labelings
- Blow-up lemma
- Approximating the independence number via the \(\vartheta\)-function
- Near-perfect clique-factors in sparse pseudorandom graphs
- Cycles of even length in graphs
- Tough Ramsey graphs without short cycles
- Hamiltonian square-paths
- Clique-factors in sparse pseudorandom graphs
- Spanning trees in random graphs
- Extremal results in sparse pseudorandom graphs
- Tough graphs and Hamiltonian circuits.
- An Improved Upper Bound on the Density of Universal Random Graphs
- Universality of Random Graphs for Graphs of Maximum Degree Two
- On the Complexity of General Graph Factor Problems
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- Expander graphs and their applications
- An algorithmic version of the blow-up lemma
- Spanning universality in random graphs
- Sparse pseudo‐random graphs are Hamiltonian
- On Pósa's Conjecture for Random Graphs
- On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem
- Triangle‐factors in pseudorandom graphs
- Reducibility among Combinatorial Problems
- Optimal threshold for a random graph to be 2-universal
- Tight Hamilton cycles in random hypergraphs
- A Sequence of Triangle-Free Pseudorandom Graphs
- Sparse universal graphs for bounded‐degree graphs
- Almost‐spanning universality in random graphs
- Quasi-random graphs
This page was built for publication: Finding any given 2‐factor in sparse pseudorandom graphs efficiently
