Pages that link to "Item:Q1946787"
From MaRDI portal
The following pages link to Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments (Q1946787):
Displaying 50 items.
- Counting and packing Hamilton cycles in dense graphs and oriented graphs (Q345082) (← links)
- A survey on Hamilton cycles in directed graphs (Q412269) (← links)
- Packing edge-disjoint triangles in regular and almost regular tournaments (Q472970) (← links)
- Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms (Q482289) (← links)
- Optimal covers with Hamilton cycles in random graphs (Q484550) (← links)
- Decomposing \(k\)-arc-strong tournaments into strong spanning subdigraphs (Q558238) (← links)
- Compatible Hamilton cycles in Dirac graphs (Q681601) (← links)
- Note on matching preclusion number of random graphs (Q784472) (← links)
- Hamilton cycles in sparse robustly expanding digraphs (Q1671669) (← links)
- The bilinear assignment problem: complexity and polynomially solvable special cases (Q1683688) (← links)
- Fair and internally fair (holey) Hamiltonian decompositions of \(K(n_0, \ldots, n_{p - 1}; \lambda_1, \lambda_2)\) (Q1685980) (← links)
- The number of Hamiltonian decompositions of regular graphs (Q1686305) (← links)
- Proof of Komlós's conjecture on Hamiltonian subsets (Q1689999) (← links)
- Decomposing tournaments into paths (Q1690018) (← links)
- Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis (Q1728217) (← links)
- Long cycles, heavy cycles and cycle decompositions in digraphs (Q1998760) (← links)
- Resolution of the Oberwolfach problem (Q2039583) (← links)
- Optimal packings of bounded degree trees (Q2279501) (← links)
- Hamilton decompositions of regular expanders: applications (Q2434714) (← links)
- Recent advances on the Hamiltonian problem: survey III (Q2441350) (← links)
- On prisms, Möbius ladders and the cycle space of dense graphs (Q2441654) (← links)
- Decompositions of complete uniform hypergraphs into Hamilton Berge cycles (Q2452426) (← links)
- Packing spanning graphs from separable families (Q2628001) (← links)
- A Short proof of the blow-up lemma for approximate decompositions (Q2678455) (← links)
- A domination algorithm for \(\{0,1\}\)-instances of the travelling salesman problem (Q2811158) (← links)
- Approximate Hamilton decompositions of robustly expanding regular digraphs (Q2870512) (← 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)
- Arbitrary Orientations of Hamilton Cycles in Digraphs (Q2944460) (← links)
- Tournaments and Semicomplete Digraphs (Q3120434) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Path and cycle decompositions of dense graphs (Q3384033) (← links)
- Hamilton decompositions of regular tournaments (Q3577676) (← 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)
- Minimalist designs (Q5120741) (← links)
- A rainbow blow‐up lemma (Q5128752) (← links)
- A rainbow blow-up lemma for almost optimally bounded edge-colourings (Q5135407) (← links)
- Almost all Steiner triple systems are almost resolvable (Q5135409) (← links)
- Automorphism groups of Walecki tournaments with zero and odd signatures (Q5198032) (← links)
- Counting Hamilton Decompositions of Oriented Graphs (Q5233804) (← links)
- Edge-disjoint Hamilton cycles in random graphs (Q5252256) (← links)
- Proof of the 1-factorization and Hamilton Decomposition Conjectures (Q5283773) (← links)
- Cycle partitions of regular graphs (Q5886097) (← links)
- The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 (Q5889065) (← links)
- Optimal path and cycle decompositions of dense quasirandom graphs (Q5890517) (← links)
- Edge-decompositions of graphs with high minimum degree (Q5890900) (← links)
- Packing, counting and covering Hamilton cycles in random directed graphs (Q5890928) (← links)
- Edge-decompositions of graphs with high minimum degree (Q5899605) (← links)
