Embedding partial triple systems

DOI10.1016/0097-3165(87)90031-8zbMath0659.05027OpenAlexW2037164600MaRDI QIDQ1112041

S. J. Stubbs, C. A. Rodger

Publication date: 1987

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(87)90031-8

zbMATH Keywords

partial triple systemtotal number of edgesmissing-edge graph

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Triple systems (05B07)

Related Items (7)

Embeddings of maximum packings in triple systems ⋮ Group divisible designs with two associate classes, and quadratic leaves of triple systems ⋮ The size of 3-uniform hypergraphs with given matching number and codegree ⋮ Small embeddings for partial triple systems of odd index ⋮ The embedding of partial triple systems when 4 divides \(\lambda\) ⋮ The Existence of Well-Balanced Triple Systems ⋮ Group divisible designs with two associate classes: \(n=2\) or \(m=2\)

Cites Work

• Small embeddings of partial directed triple systems and partial triple systems with even \(\lambda\)
• Tripelsysteme mit Untersystemen
• A partial Steiner triple system of order n can be embedded in a Steiner triple system of order 6n + 3
• The completion of finite incomplete Steiner triple systems with applications to loop theory
• Embedding Partial Graph Designs, Block Designs, and Triple Systems with λ > 1
• The Existence and Construction of Balanced Incomplete Block Designs
• A Survey of Embedding Theorems for Steiner Systems
• Embedding Partial Steiner Triple Systems
• On A Particular Conference Scheduling Problem
• The Solution of a Timetabling Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Embedding partial triple systems