A proof of Lindner's conjecture on embeddings of partial Steiner triple systems

From MaRDI portal
Publication:3614753

DOI10.1002/jcd.20189zbMath1221.05029OpenAlexW2138430007WikidataQ123244227 ScholiaQ123244227MaRDI QIDQ3614753

Daniel Horsley, Darryn E. Bryant

Publication date: 9 March 2009

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.20189




Related Items

On the embedding of partial three path designsSmall embeddings for partial 5-cycle systemsOn deficiency problems for graphsThe Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹Embedding partial totally symmetric quasigroups.On the intersection problem for Steiner triple systems of different ordersA polynomial ideal associated to any $t$-$(v,k,\lambda)$ designSmall Embeddings of Partial Steiner Triple SystemsThe \(n\)-queens completion problemSteiner triple systems of order 21 with a transversal subdesign \(\mathrm{TD}(3, 6)\)Graph divisible designs and packing constructionsOn determining when small embeddings of partial Steiner triple systems existCompletion and deficiency problemsThe (7, 4)-Conjecture in Finite GroupsOn balanced incomplete block designs with specified weak chromatic numberSmall embeddings for partial triple systems of odd indexOn regular set systems containing regular subsystemsPacking cycles in complete graphsEmbedding partial odd-cycle systems in systems with orders in all admissible congruence classesEmbedding Factorizations for 3-Uniform HypergraphsEmbedding in a perfect codeEnclosings of \(\lambda \)-fold 4-cycle systemsA finite embedding theorem for partial Steiner 3-designsEmbedding partial 4-cycle systems of arbitrary indexConstructing and embedding mutually orthogonal Latin squares: reviewing both new and existing results



Cites Work