On determining when small embeddings of partial Steiner triple systems exist

DOI10.1002/jcd.21715arXiv1911.02196OpenAlexW3012072044MaRDI QIDQ6187453

Darryn E. Bryant, Ajani De Vas Gunasekara, Daniel Horsley

Publication date: 31 January 2024

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

Full work available at URL: https://arxiv.org/abs/1911.02196

zbMATH Keywords

embeddingsNP-completenesspartial Steiner triple systems

Mathematics Subject Classification ID

Triple systems (05B07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Embedding partial Steiner triple systems is NP-complete
• Embeddings of Steiner triple systems
• Embedding Partial Steiner Triple Systems with Few Triples
• A conjecture on small embeddings of partial Steiner triple systems
• Fractional Triangle Decompositions in Graphs with Large Minimum Degree
• A proof of Lindner's conjecture on embeddings of partial Steiner triple systems
• The NP-Completeness of Edge-Coloring
• Edge-decompositions of graphs with high minimum degree

This page was built for publication: On determining when small embeddings of partial Steiner triple systems exist