Saturation for the 3-uniform loose 3-cycle

DOI10.1016/j.disc.2023.113504zbMath1527.05128arXiv2202.07149OpenAlexW4377101641MaRDI QIDQ6091820

Sean English, Alexandr V. Kostochka, Dara Zirlin

Publication date: 27 November 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

hypergraphssaturationdischargingloose cycles

Mathematics Subject Classification ID

Hypergraphs (05C65) Paths and cycles (05C38) Distance in graphs (05C12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An introduction to the discharging method via graph coloring
• A survey of minimum saturated graphs
• Upper bounds on the minimum size of Hamilton saturated hypergraphs
• Minimizing the number of edges in \(\mathcal{C}_{\geq r} \)-saturated graphs
• Saturation of Berge hypergraphs
• A note on saturation for Berge-\(G\) hypergraphs
• On saturation of Berge hypergraphs
• On the number of edges in a minimum \(C_6\)-saturated graph
• Saturation numbers for trees
• Linearity of saturation for Berge hypergraphs
• All minimum C5-saturated graphs
• Minimum C₅‐saturated graphs
• Saturated graphs with minimal number of edges
• Hamiltonian chains in hypergraphs
• Saturation numbers for families of graph subdivisions
• Cycle-Saturated Graphs with Minimum Number of Edges
• The Minimum Size of Saturated Hypergraphs
• Nearly-Regular Hypergraphs and Saturation of Berge Stars
• A Problem in Graph Theory
• On generalized graphs
• Variations on the Hamiltonian Theme
• Constructive upper bounds for cycle-saturated graphs of minimum size

This page was built for publication: Saturation for the 3-uniform loose 3-cycle