The following pages link to A proof of Ringel's conjecture (Q2232153):
Displaying 22 items.
- Decomposition of \(K_{13}\) into a torus graph and a graph imbedded in the Klein bottle (Q1193437) (← links)
- On zero-sum spanning trees and zero-sum connectivity (Q2073300) (← links)
- On asymptotic packing of geometric graphs (Q2081476) (← links)
- Decomposing hypergraphs into cycle factors (Q2101168) (← links)
- Decomposition of \((2k + 1)\)-regular graphs containing special spanning \(2k\)-regular Cayley graphs into paths of length \(2k + 1\) (Q2142644) (← links)
- The \(n\)-queens completion problem (Q2157925) (← links)
- The generalised Oberwolfach problem (Q2664557) (← links)
- A Short proof of the blow-up lemma for approximate decompositions (Q2678455) (← links)
- Proof of a conjecture involving derangements and roots of unity (Q2699649) (← links)
- Edge decompositions of the complete graph into copies of a connected subgraph (Q4085755) (← links)
- Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree (Q5039053) (← links)
- A rainbow blow-up lemma for almost optimally bounded edge-colourings (Q5135407) (← links)
- Repeated Patterns in Proper Colorings (Q5157390) (← links)
- Constrained Ramsey numbers for the loose path, cycle and star (Q6056382) (← links)
- On sufficient conditions for spanning structures in dense graphs (Q6075109) (← links)
- Perfectly packing graphs with bounded degeneracy and many leaves (Q6165180) (← links)
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 (Q6170531) (← links)
- Gregarious \(Y_5\)-tree decompositions of tensor product of complete graphs (Q6558937) (← links)
- Ramsey numbers for multiple copies of sparse graphs (Q6565813) (← links)
- Local rainbow colorings for various graphs (Q6574396) (← links)
- Apportionable matrices and gracefully labelled graphs (Q6592910) (← links)
- Transference for loose Hamilton cycles in random 3-uniform hypergraphs (Q6596385) (← links)
