Pages that link to "Item:Q3504921"

The following pages link to Asymptotic Existence of Resolvable Graph Designs (Q3504921):

Displaying 18 items.

• The existence of \((K_2\times K_6)\)-designs (Q367091) (← links)
• Resolvable group divisible designs with large groups (Q727201) (← links)
• The asymptotic existence of \(\mathrm{DR}(v,k,k-1)\)-BIBDs (Q887440) (← links)
• Ramsey-nice families of graphs (Q1645058) (← links)
• A family of resolvable regular graph designs (Q1923524) (← links)
• Symmetric graph designs (Q1972324) (← links)
• The Hamilton-Waterloo problem with even cycle lengths (Q2319702) (← links)
• Constructions and uses of incomplete pairwise balanced designs (Q2334435) (← links)
• Thickly-resolvable block designs (Q2800792) (← links)
• An existence theory for loopy graph decompositions (Q3087610) (← links)
• (Q3318791) (← links)
• (Q3424001) (← links)
• Designs with mutually orthogonal resolutions and decompositions of edge‐colored graphs (Q3578140) (← links)
• A blow-up lemma for approximate decompositions (Q4633567) (← links)
• The Asymptotic Existence of Resolvable Group Divisible Designs (Q4921426) (← links)
• The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 (Q5889065) (← links)
• Balancing permuted copies of multigraphs and integer matrices (Q6162862) (← links)
• A survey on constructive methods for the Oberwolfach problem and its variants (Q6613359) (← links)