205 results on '"HORSLEY, DANIEL"'
Search Results
2. Bounds on data limits for all-to-all comparison from combinatorial designs
3. Bounds on data limits for all-to-all comparison from combinatorial designs
4. Minimising the total number of subsets and supersets
5. Exact values for unbalanced Zarankiewicz numbers
6. Block avoiding point sequencings of partial Steiner systems
7. Smaller embeddings of partial $k$-star decompositions
8. Minimising the total number of subsets and supersets
9. Distributing hash families with few rows
10. Disjoint spread systems and fault location
11. More constructions for Sperner partition systems
12. Countable homogeneous Steiner triple systems avoiding specified subsystems
13. An Evans-style result for block designs
14. Nov\'{a}k's conjecture on cyclic Steiner triple systems and its generalization
15. The cyclic matching sequenceability of regular graphs
16. On determining when small embeddings of partial Steiner triple systems exist
17. Generating infinite digraphs by derangements
18. Zarankiewicz numbers near the triple system threshold
19. Block avoiding point sequencings of partial Steiner systems
20. On the minimum degree required for a triangle decomposition
21. New bounds on the maximum size of Sperner partition systems
22. Induced path factors of regular graphs
23. Decompositions of complete multigraphs into stars of varying sizes
24. MAX for $k$-independence in multigraphs
25. New lower bounds for $t$-coverings
26. Steiner triple systems with high chromatic index
27. Novák's conjecture on cyclic Steiner triple systems and its generalization
28. Decomposing $K_{u+w}-K_u$ into cycles of various lengths
29. Countable homogeneous Steiner triple systems avoiding specified subsystems
30. Decompositions of complete multigraphs into cycles of varying lengths
31. More nonexistence results for symmetric pair coverings
32. Compressed sensing with combinatorial designs: theory and simulations
33. On factorisations of complete graphs into circulant graphs and the Oberwolfach Problem
34. Doyen-Wilson results for odd length cycle systems
35. Generalising Fisher's inequality to coverings and packings
36. New bounds on the maximum size of Sperner partition systems
37. Decompositions of complete multigraphs into stars of varying sizes
38. Exact values for some unbalanced Zarankiewicz numbers.
39. Steiner triple systems without parallel classes
40. Hierarchical Recovery in Compressive Sensing
41. Embedding partial Steiner triple systems with few triples
42. On balanced incomplete block designs with specified weak chromatic number
43. MAX for [formula omitted]-independence in multigraphs
44. Decompositions of complete graphs into cycles of arbitrary lengths
45. Decomposing various graphs into short even-length cycles
46. Decompositions of complete multigraphs into cycles of varying lengths
47. A hierarchical framework for recovery in compressive sensing
48. Smaller Embeddings of Partial $k$-Star Decompositions
49. Generalising Fisher’s inequality to coverings and packings
50. On balanced incomplete block designs with specified weak chromatic number
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.