On Extremal k-Graphs Without Repeated Copies of 2-Intersecting Edges

DOI10.1137/060675915MaRDI QIDQ3519213zbMATH OpenOpenAlexFDO

Authors Yeow Meng Chee, Alan C. H. Ling

Publication date 13 August 2008

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

hypergraphpackingcombinatorial design

Mathematics Subject Classification ID

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

Abstract: The problem of determining extremal hypergraphs containing at most r isomorphic copies of some element of a given hypergraph family was first studied by Boros et al. in 2001. There are not many hypergraph families for which exact results are known concerning the size of the corresponding extremal hypergraphs, except for those equivalent to the classical Turan numbers. In this paper, we determine the size of extremal k-uniform hypergraphs containing at most one pair of 2-intersecting edges for k in {3,4}. We give a complete solution when k=3 and an almost complete solution (with eleven exceptions) when k=4.

Recommendations

• Hypergraphs of Bounded Disjointness
• On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
• Asymptotic solution of a Turán-type problem
• Extremal problems in uniformly dense hypergraphs
• Some Ramsey-Turán type results for hypergraphs

Cited in

(5)

• The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths
• Extremal numbers for directed hypergraphs with two edges
• On the non-existence of families of \((d,k, \delta)\)-digraphs containing only selfrepeat vertices
• On graphs that contain exactly \(k\) copies of a subgraph, and a related problem in search theory
• Combination of bases and an evaluation of the set of extremal 3-uniform hypergraphs

This page was built for publication: On Extremal k-Graphs Without Repeated Copies of 2-Intersecting Edges

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