Daniel Horsley

From MaRDI portal
Person:681599

Available identifiers

zbMath Open horsley.danielMaRDI QIDQ681599

List of research outcomes

PublicationDate of PublicationType
Minimising the total number of subsets and supersets2024-03-26Paper
Exact values for some unbalanced Zarankiewicz numbers2024-03-25Paper
More constructions for Sperner partition systems2024-02-02Paper
On determining when small embeddings of partial Steiner triple systems exist2024-01-31Paper
Zarankiewicz numbers near the triple system threshold2023-10-19Paper
The cyclic matching sequenceability of regular graphs2023-10-04Paper
Induced path factors of regular graphs2023-09-29Paper
Bounds on data limits for all-to-all comparison from combinatorial designs2023-08-31Paper
Smaller embeddings of partial \(k\)-star decompositions2023-02-17Paper
Block avoiding point sequencings of partial Steiner systems2022-09-22Paper
An Evans-Style Result for Block Designs2022-01-07Paper
Smaller embeddings of partial $k$-star decompositions2021-09-28Paper
Generating Infinite Digraphs by Derangements2021-09-21Paper
Novák's conjecture on cyclic Steiner triple systems and its generalization2021-08-25Paper
Countable homogeneous Steiner triple systems avoiding specified subsystems2021-02-22Paper
New bounds on the maximum size of Sperner partition systems2021-02-08Paper
Decompositions of complete multigraphs into stars of varying sizes2020-09-24Paper
On the Minimum Degree Required for a Triangle Decomposition2020-03-04Paper
\(SUE(s^2)\)-optimal supersaturated designs2020-01-20Paper
Distributing hash families with few rows2019-11-13Paper
Switching techniques for edge decompositions of graphs2019-09-25Paper
https://portal.mardi4nfdi.de/entity/Q52300402019-08-20Paper
MAX for \(k\)-independence in multigraphs2019-07-17Paper
Pseudo generalized Youden designs2018-11-23Paper
Generalising Fisher's inequality to coverings and packings2018-02-12Paper
Decompositions of complete multigraphs into cycles of varying lengths2018-02-09Paper
A hierarchical framework for recovery in compressive sensing2018-01-11Paper
Steiner Triple Systems with High Chromatic Index2017-11-24Paper
Compressed Sensing With Combinatorial Designs: Theory and Simulations2017-10-19Paper
New lower bounds for $t$-coverings2017-06-21Paper
Decomposing \(K_{u + w} - K_u\) into cycles of prescribed lengths2017-05-22Paper
On factorisations of complete graphs into circulant graphs and the Oberwolfach problem2016-12-02Paper
Disjoint Spread Systems and Fault Location2016-10-28Paper
Doyen-Wilson Results for Odd Length Cycle Systems2016-08-22Paper
More nonexistence results for symmetric pair coverings2015-11-10Paper
A second infinite family of Steiner triple systems without almost parallel classes2015-06-19Paper
Steiner Triple Systems without Parallel Classes2015-05-20Paper
Embedding Partial Steiner Triple Systems with Few Triples2014-12-22Paper
Small Embeddings of Partial Steiner Triple Systems2014-10-02Paper
Cycle decompositions V: Complete graphs into cycles of arbitrary lengths2014-06-19Paper
Sequence Covering Arrays2014-04-10Paper
Hierarchical Recovery in Compressive Sensing2014-03-04Paper
Resolvability of infinite designs2014-01-31Paper
On balanced incomplete block designs with specified weak chromatic number2014-01-31Paper
Strengthening hash families and compressive sensing2013-01-18Paper
Decomposing various graphs into short even-length cycles2013-01-03Paper
Trails of triples in partial triple systems2012-11-28Paper
On the non-existence of pair covering designs with at least as many points as blocks2012-04-26Paper
Maximum packings of the complete graph with uniform length cycles2011-10-12Paper
Existential closure of block intersection graphs of infinite designs having infinite block size2011-08-16Paper
Cycle decompositions of complete multigraphs2011-02-04Paper
On cycle systems with specified weak chromatic number2010-09-27Paper
An asymptotic solution to the cycle decomposition problem for complete graphs2010-09-27Paper
Embedding partial odd-cycle systems in systems with orders in all admissible congruence classes2010-08-03Paper
Decompositions of complete graphs into long cycles2009-11-20Paper
A proof of Lindner's conjecture on embeddings of partial Steiner triple systems2009-03-09Paper
Packing cycles in complete graphs2008-10-07Paper
Steiner triple systems with two disjoint subsystems2006-03-24Paper
Decompositions into 2-regular subgraphs and equitable partial cycle decompositions2005-02-09Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Daniel Horsley