Pages that link to "Item:Q2434714"
From MaRDI portal
The following pages link to Hamilton decompositions of regular expanders: applications (Q2434714):
Displaying 28 items.
- Counting and packing Hamilton cycles in dense graphs and oriented graphs (Q345082) (← links)
- Packing tree factors in random and pseudo-random graphs (Q405193) (← links)
- Optimal covers with Hamilton cycles in random graphs (Q484550) (← links)
- Note on matching preclusion number of random graphs (Q784472) (← links)
- Hamilton cycles in sparse robustly expanding digraphs (Q1671669) (← links)
- The number of Hamiltonian decompositions of regular graphs (Q1686305) (← links)
- Packing arborescences in random digraphs (Q1689982) (← links)
- Proof of Komlós's conjecture on Hamiltonian subsets (Q1689999) (← links)
- Decomposing tournaments into paths (Q1690018) (← links)
- Optimal packings of bounded degree trees (Q2279501) (← links)
- On prisms, Möbius ladders and the cycle space of dense graphs (Q2441654) (← links)
- Packing spanning graphs from separable families (Q2628001) (← links)
- Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments (Q2922881) (← links)
- The robust component structure of dense regular graphs and applications (Q2940076) (← links)
- Path and cycle decompositions of dense graphs (Q3384033) (← links)
- Properties, proved and conjectured, of Keller, Mycielski, and queen graphs (Q4604531) (← links)
- Packing Arborescences in Random Digraphs (Q4627483) (← links)
- A blow-up lemma for approximate decompositions (Q4633567) (← links)
- An approximate version of Jackson’s conjecture (Q4993113) (← links)
- A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense Regular Graphs (Q5084096) (← links)
- Decomposing Graphs of High Minimum Degree into 4‐Cycles (Q5265328) (← links)
- Proof of the 1-factorization and Hamilton Decomposition Conjectures (Q5283773) (← links)
- Packing and counting arbitrary Hamilton cycles in random digraphs (Q5381053) (← links)
- Optimal path and cycle decompositions of dense quasirandom graphs (Q5890517) (← links)
- Packing, counting and covering Hamilton cycles in random directed graphs (Q5890928) (← links)
- Packing, counting and covering Hamilton cycles in random directed graphs (Q5918227) (← links)
- Path decompositions of tournaments (Q6075058) (← links)
- Hamilton cycles in dense regular digraphs and oriented graphs (Q6144396) (← links)
