On the sizes of \((k, l)\)-edge-maximal \(r\)-uniform hypergraphs

DOI10.7151/dmgt.2362zbMath1504.05205arXiv1805.11425OpenAlexW3090980633MaRDI QIDQ2107753

Hong-Jian Lai, Murong Xu, Yingzhi Tian, Ji Xiang Meng

Publication date: 2 December 2022

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

\(r\)-uniform hypergraphs\((k, l)\)-edge-maximal hypergraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Cites Work

• Unnamed Item
• An edge extremal result for subcohesion
• On the sizes of \(k\)-edge-maximal \(r\)-uniform hypergraphs
• Minimale \(n\)-fach kantenzusammenhängende Graphen
• Edge‐maximal (k, i)‐graphs
• Connectivity in Hypergraphs
• The size of strength‐maximal graphs
• Connection and separation in hypergraphs
• k-Components, Clusters and Slicings in Graphs

This page was built for publication: On the sizes of \((k, l)\)-edge-maximal \(r\)-uniform hypergraphs