Uniquely \(K_r^{(k)}\)-saturated hypergraphs

zbMath1402.05157arXiv1712.03208MaRDI QIDQ1627212

Charles Viss, Stephen G. Hartke, András Gyárfás

Publication date: 22 November 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

hypergraphsuniquely saturated

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Hypergraphs (05C65) Extremal set theory (05D05) Transversal (matching) theory (05D15)

Related Items

Saturation number of \(tK_{l,l,l}\) in the complete tripartite graph

Uses Software

• SageMath
• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Uniquely tree-saturated graphs
• Minimum number of elements of representing a set system of given rank
• On the chromatic number, colorings, and codes of the Johnson graph
• Uniquely \(C _{4}\)-saturated graphs
• Uniquely \(K_r\)-saturated graphs
• On Moore Graphs with Diameters 2 and 3
• Lower bounds for constant weight codes
• Uniquely Cycle‐Saturated Graphs
• A Problem in Graph Theory