The following pages link to Daniel Horsley (Q681599):
Displaying 50 items.
- Generalising Fisher's inequality to coverings and packings (Q681600) (← links)
- Decompositions of complete multigraphs into cycles of varying lengths (Q684123) (← links)
- Trails of triples in partial triple systems (Q690676) (← links)
- Decompositions into 2-regular subgraphs and equitable partial cycle decompositions (Q707023) (← links)
- More nonexistence results for symmetric pair coverings (Q890552) (← links)
- Packing cycles in complete graphs (Q947728) (← links)
- A hierarchical framework for recovery in compressive sensing (Q1693135) (← links)
- Decomposing various graphs into short even-length cycles (Q1928579) (← links)
- Strengthening hash families and compressive sensing (Q1932362) (← links)
- On cycle systems with specified weak chromatic number (Q1957974) (← links)
- An asymptotic solution to the cycle decomposition problem for complete graphs (Q1957980) (← links)
- Novák's conjecture on cyclic Steiner triple systems and its generalization (Q2049450) (← links)
- Decompositions of complete multigraphs into stars of varying sizes (Q2200917) (← links)
- New bounds on the maximum size of Sperner partition systems (Q2225393) (← links)
- Countable homogeneous Steiner triple systems avoiding specified subsystems (Q2229200) (← links)
- \(SUE(s^2)\)-optimal supersaturated designs (Q2288828) (← links)
- MAX for \(k\)-independence in multigraphs (Q2312650) (← links)
- Distributing hash families with few rows (Q2333821) (← links)
- A second infinite family of Steiner triple systems without almost parallel classes (Q2349208) (← links)
- Decomposing \(K_{u + w} - K_u\) into cycles of prescribed lengths (Q2397526) (← links)
- On the non-existence of pair covering designs with at least as many points as blocks (Q2428629) (← links)
- Resolvability of infinite designs (Q2434885) (← links)
- On balanced incomplete block designs with specified weak chromatic number (Q2434889) (← links)
- Block avoiding point sequencings of partial Steiner systems (Q2673985) (← links)
- Smaller embeddings of partial \(k\)-star decompositions (Q2684891) (← links)
- Doyen-Wilson Results for Odd Length Cycle Systems (Q2816379) (← links)
- Disjoint Spread Systems and Fault Location (Q2830441) (← links)
- On factorisations of complete graphs into circulant graphs and the Oberwolfach problem (Q2835398) (← links)
- Embedding Partial Steiner Triple Systems with Few Triples (Q2935265) (← links)
- Existential closure of block intersection graphs of infinite designs having infinite block size (Q3087614) (← links)
- Maximum packings of the complete graph with uniform length cycles (Q3174232) (← links)
- Small Embeddings of Partial Steiner Triple Systems (Q3191441) (← links)
- Steiner triple systems with two disjoint subsystems (Q3376667) (← links)
- Generating Infinite Digraphs by Derangements (Q3382302) (← links)
- Embedding partial odd-cycle systems in systems with orders in all admissible congruence classes (Q3576977) (← links)
- A proof of Lindner's conjecture on embeddings of partial Steiner triple systems (Q3614753) (← links)
- Decompositions of complete graphs into long cycles (Q3646380) (← links)
- Pseudo generalized Youden designs (Q4556026) (← links)
- Steiner Triple Systems with High Chromatic Index (Q4594482) (← links)
- Cycle decompositions V: Complete graphs into cycles of arbitrary lengths (Q4979770) (← links)
- An Evans-Style Result for Block Designs (Q5020831) (← links)
- On the Minimum Degree Required for a Triangle Decomposition (Q5218438) (← links)
- (Q5230040) (← links)
- Switching techniques for edge decompositions of graphs (Q5234222) (← links)
- Steiner Triple Systems without Parallel Classes (Q5251663) (← links)
- Compressed Sensing With Combinatorial Designs: Theory and Simulations (Q5369841) (← links)
- Sequence Covering Arrays (Q5408596) (← links)
- Cycle decompositions of complete multigraphs (Q5894089) (← links)
- Induced path factors of regular graphs (Q6055940) (← links)
- The cyclic matching sequenceability of regular graphs (Q6056787) (← links)
