Independence number of hypergraphs under degree conditions

DOI10.1002/RSA.21151MaRDI QIDQ6076735zbMATH OpenFDO

Authors

Publication date 17 October 2023

Published in Random Structures \& Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

hypergraphindependent setsemi-random methoddegree Turán density

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Hypergraphs (05C65)

Abstract: A well-known result of Ajtai et al. from 1982 states that every $k$-graph $H$ on $n$ vertices, with girth at least five, and average degree $t^{k-1}$ contains an independent set of size $cn(logt{)}^{1/(k-1)}/t$ for some $c>0$. In this paper we show that an independent set of the same size can be found under weaker conditions allowing certain cycles of length 2, 3 and 4. Our work is motivated by a problem of Lo and Zhao, who asked for $kge4$, how large of an independent set a $k$-graph $H$ on $n$ vertices necessarily has when its maximum $(k-2)$-degree $Delt{a}_{k-2}(H)ledn$. (The corresponding problem with respect to $(k-1)$-degrees was solved by Kostochka, Mubayi, and Varstra"ete [Random Structures & Algorithms 44, 224--239, 2014].) In this paper we show that every $k$-graph $H$ on $n$ vertices with $Delt{a}_{k-2}(H)ledn$ contains an independent set of size $c(fracndloglogfracnd{)}^{1/(k-1)}$, and under additional conditions, an independent set of size $c(fracndlogfracnd{)}^{1/(k-1)}$. The former assertion gives a new upper bound for the $(k-2)$-degree Tur'an density of complete $k$-graphs.

Recommendations

• New results on \(k\)-independence of hypergraphs
• On the independence number of non-uniform uncrowded hypergraphs
• On uncrowded hypergraphs
• Independence in 5-uniform hypergraphs
• New results on \(k\)-independence of graphs

Cites work

• scientific article; zbMATH DE number 3843786 (Why is no real title available?)
• scientific article; zbMATH DE number 3344609 (Why is no real title available?)
• A dense infinite Sidon sequence
• A note on the random greedy independent set algorithm
• Bounding the independence number in some \((n,k,\ell,\lambda)\)-hypergraphs
• Co-degree density of hypergraphs
• Codegree Turán density of complete \(r\)-uniform hypergraphs
• Coloring sparse hypergraphs
• Extremal uncrowded hypergraphs
• Independent sets in hypergraphs omitting an intersection
• Note on independent sets in steiner systems
• On independent sets in hypergraphs
• On the codegree density of complete 3-graphs and related problems
• On the independence number of non-uniform uncrowded hypergraphs
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Turan's theorem for k-graphs
• \({\ell}\)-degree Turán density

Cited in

(6)

• Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs
• New results on \(k\)-independence of hypergraphs
• The critical independence number and an independence decomposition
• On the independence number of non-uniform uncrowded hypergraphs
• Independence and Matchings in $\sigma$-hypergraphs
• A degree sum condition concerning the connectivity and the independence number of a graph

This page was built for publication: Independence number of hypergraphs under degree conditions

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