Daniel Horsley

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Completing the solution of the directed Oberwolfach problem with two tables The Electronic Journal of Combinatorics	2026-03-20	Paper
Bounds on data limits for all-to-all comparison from combinatorial designs Designs, Codes and Cryptography	2024-10-14	Paper
Zarankiewicz numbers near the triple system threshold Journal of Combinatorial Designs	2024-08-08	Paper
New lower bounds for $t$-coverings Journal of Combinatorial Designs	2024-07-16	Paper
Minimising the total number of subsets and supersets European Journal of Combinatorics	2024-03-26	Paper
Exact values for some unbalanced Zarankiewicz numbers Journal of Graph Theory	2024-03-25	Paper
More constructions for Sperner partition systems Journal of Combinatorial Designs	2024-02-02	Paper
On determining when small embeddings of partial Steiner triple systems exist Journal of Combinatorial Designs	2024-01-31	Paper
Zarankiewicz numbers near the triple system threshold	2023-10-19	Paper
The cyclic matching sequenceability of regular graphs Journal of Graph Theory	2023-10-04	Paper
Induced path factors of regular graphs Journal of Graph Theory	2023-09-29	Paper
Bounds on data limits for all-to-all comparison from combinatorial designs	2023-08-31	Paper
Smaller embeddings of partial $k$-star decompositions The Electronic Journal of Combinatorics	2023-02-17	Paper
Block avoiding point sequencings of partial Steiner systems Designs, Codes and Cryptography	2022-09-22	Paper
An Evans-style result for block designs SIAM Journal on Discrete Mathematics	2022-01-07	Paper
Smaller embeddings of partial $k$-star decompositions (available as arXiv preprint)	2021-09-28	Paper
Generating infinite digraphs by derangements The Quarterly Journal of Mathematics	2021-09-21	Paper
Novák's conjecture on cyclic Steiner triple systems and its generalization Journal of Combinatorial Theory. Series A	2021-08-25	Paper
Countable homogeneous Steiner triple systems avoiding specified subsystems Journal of Combinatorial Theory. Series A	2021-02-22	Paper
New bounds on the maximum size of Sperner partition systems European Journal of Combinatorics	2021-02-08	Paper
Decompositions of complete multigraphs into stars of varying sizes Journal of Combinatorial Theory. Series B	2020-09-24	Paper
On the minimum degree required for a triangle decomposition SIAM Journal on Discrete Mathematics	2020-03-04	Paper
$SUE(s^2)$-optimal supersaturated designs Statistics & Probability Letters	2020-01-20	Paper
Distributing hash families with few rows Theoretical Computer Science	2019-11-13	Paper
Switching techniques for edge decompositions of graphs Surveys in Combinatorics 2017	2019-09-25	Paper
The embedding problem for partial Steiner triple systems	2019-08-20	Paper
MAX for $k$-independence in multigraphs Discrete Applied Mathematics	2019-07-17	Paper
Pseudo generalized Youden designs Journal of Combinatorial Designs	2018-11-23	Paper
Generalising Fisher's inequality to coverings and packings Combinatorica	2018-02-12	Paper
Decompositions of complete multigraphs into cycles of varying lengths Journal of Combinatorial Theory. Series B	2018-02-09	Paper
A hierarchical framework for recovery in compressive sensing Discrete Applied Mathematics	2018-01-11	Paper
Steiner triple systems with high chromatic index SIAM Journal on Discrete Mathematics	2017-11-24	Paper
Compressed Sensing With Combinatorial Designs: Theory and Simulations IEEE Transactions on Information Theory	2017-10-19	Paper
New lower bounds for $t$-coverings	2017-06-21	Paper
Decomposing $K_{u + w} - K_u$ into cycles of prescribed lengths Discrete Mathematics	2017-05-22	Paper
On factorisations of complete graphs into circulant graphs and the Oberwolfach problem Ars Mathematica Contemporanea	2016-12-02	Paper
Disjoint spread systems and fault location SIAM Journal on Discrete Mathematics	2016-10-28	Paper
Doyen-Wilson results for odd length cycle systems Journal of Combinatorial Designs	2016-08-22	Paper
More nonexistence results for symmetric pair coverings Linear Algebra and its Applications	2015-11-10	Paper
A second infinite family of Steiner triple systems without almost parallel classes Journal of Combinatorial Theory. Series A	2015-06-19	Paper
Steiner triple systems without parallel classes SIAM Journal on Discrete Mathematics	2015-05-20	Paper
Steiner triple systems without parallel classes SIAM Journal on Discrete Mathematics	2015-05-20	Paper
Embedding partial Steiner triple systems with few triples SIAM Journal on Discrete Mathematics	2014-12-22	Paper
Small embeddings of partial Steiner triple systems Journal of Combinatorial Designs	2014-10-02	Paper
Cycle decompositions. V: Complete graphs into cycles of arbitrary lengths Proceedings of the London Mathematical Society	2014-06-19	Paper
Sequence covering arrays SIAM Journal on Discrete Mathematics	2014-04-10	Paper
Hierarchical Recovery in Compressive Sensing	2014-03-04	Paper
Resolvability of infinite designs Journal of Combinatorial Theory. Series A	2014-01-31	Paper
On balanced incomplete block designs with specified weak chromatic number Journal of Combinatorial Theory. Series A	2014-01-31	Paper
Strengthening hash families and compressive sensing Journal of Discrete Algorithms	2013-01-18	Paper
Decomposing various graphs into short even-length cycles Annals of Combinatorics	2013-01-03	Paper
Trails of triples in partial triple systems Designs, Codes and Cryptography	2012-11-28	Paper
On the non-existence of pair covering designs with at least as many points as blocks Combinatorica	2012-04-26	Paper
Maximum packings of the complete graph with uniform length cycles Journal of Graph Theory	2011-10-12	Paper
Existential closure of block intersection graphs of infinite designs having infinite block size Journal of Combinatorial Designs	2011-08-16	Paper
Cycle decompositions of complete multigraphs Journal of Combinatorial Designs	2011-02-04	Paper
An asymptotic solution to the cycle decomposition problem for complete graphs Journal of Combinatorial Theory. Series A	2010-09-27	Paper
On cycle systems with specified weak chromatic number Journal of Combinatorial Theory. Series A	2010-09-27	Paper
Embedding partial odd-cycle systems in systems with orders in all admissible congruence classes Journal of Combinatorial Designs	2010-08-03	Paper
Decompositions of complete graphs into long cycles Bulletin of the London Mathematical Society	2009-11-20	Paper
A proof of Lindner's conjecture on embeddings of partial Steiner triple systems Journal of Combinatorial Designs	2009-03-09	Paper
Packing cycles in complete graphs Journal of Combinatorial Theory. Series B	2008-10-07	Paper
Steiner triple systems with two disjoint subsystems Journal of Combinatorial Designs	2006-03-24	Paper
Decompositions into 2-regular subgraphs and equitable partial cycle decompositions Journal of Combinatorial Theory. Series B	2005-02-09	Paper

Research outcomes over time

This page was built for person: Daniel Horsley