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

DOI10.7151/DMGT.2362zbMATH Open1504.05205arXiv1805.11425OpenAlexW3090980633MaRDI QIDQ2107753FDOQ2107753

Authors: Yingzhi Tian, Hong-Jian Lai, Murong Xu, Jixiang Meng 

Publication date: 2 December 2022

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

Abstract: Let $H=(V,E)$ be a hypergraph, where $V$ is a set of vertices and $E$ is a set of non-empty subsets of $V$ called edges. If all edges of $H$ have the same cardinality $r$, then $H$ is a $r$-uniform hypergraph; if $E$ consists of all $r$-subsets of $V$, then $H$ is a complete $r$-uniform hypergraph, denoted by $K_n^r$, where $n=|V|$. A $r$-uniform hypergraph $H=(V,E)$ is $(k,l)$-edge-maximal if every subhypergraph $H^{\prime }$ of $H$ with $|V(H^{\prime })|geql$ has edge-connectivity at most $k$, but for any edge $einE(K_n^r)setminusE(H)$, $H+e$ contains at least one subhypergraph $H^{″}$ with $|V(H^{″})|geql$ and edge-connectivity at least $k+1$. In this paper, we obtain the lower bounds and the upper bounds of the sizes of $(k,l)$-edge-maximal hypergraphs. Furthermore, we show that these bounds are best possible. Thus prior results in [Y.Z. Tian, L.Q. Xu, H.-J. Lai, J.X. Meng, On the sizes of $k$-edge-maximal $r$-uniform hypergraphs, arXiv:1802.08843v3] are extended.

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

Recommendations

• On the sizes of \(k\)-edge-maximal \(r\)-uniform hypergraphs
• On the sizes of vertex-\(k\)-maximal \(r\)-uniform hypergraphs
• Sufficient conditions for hypergraphs to be maximally edge-connected
• Edge‐maximal (k, i)‐graphs
• Uniform hypergraphs under certain intersection constraints between hyperedges

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Title not available (Why is that?)
• Bounds on the number of edges of edge-minimal, edge-maximal and \(l\)-hypertrees
• On the sizes of \(k\)-edge-maximal \(r\)-uniform hypergraphs
• Uniform hypergraphs under certain intersection constraints between hyperedges
• On the sizes of vertex-\(k\)-maximal \(r\)-uniform hypergraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2107753)