On hypergraphs of girth five
From MaRDI portal
Publication:1408529
zbMath1023.05131MaRDI QIDQ1408529
Felix Lazebnik, Jacques Verstraete
Publication date: 24 September 2003
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/122974
File on IPFS
Extremal set theory (05D05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Extremal combinatorics (05D99)
Related Items (51)
Turán numbers for hypergraph star forests ⋮ Nearly-Regular Hypergraphs and Saturation of Berge Stars ⋮ Minimal paths and cycles in set systems ⋮ Triangle-free induced subgraphs of the unitary polarity graph ⋮ Proof of a conjecture on monomial graphs ⋮ The linear Turán number of small triple systems or why is the wicket interesting? ⋮ 3-uniform hypergraphs without a cycle of length five ⋮ Connectivity of some algebraically defined digraphs ⋮ On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\) ⋮ Triangles in C5‐free graphs and hypergraphs of girth six ⋮ On regular hypergraphs of high girth ⋮ Counting hypergraphs with large girth ⋮ Linearity of saturation for Berge hypergraphs ⋮ Hypergraphs with no cycle of length 4 ⋮ Improved lower bounds for multiplicative square-free sequences ⋮ Book free 3-uniform hypergraphs ⋮ On \(3\)-uniform hypergraphs avoiding a cycle of length four ⋮ Extremal Results for Berge Hypergraphs ⋮ Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs ⋮ 3-uniform hypergraphs avoiding a given odd cycle ⋮ Sparse Hypergraphs with Applications to Coding Theory ⋮ \(k\)-fold Sidon sets ⋮ A counterexample to sparse removal ⋮ A linear hypergraph extension of the bipartite Turán problem ⋮ Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers ⋮ Pentagons vs. triangles ⋮ Quantum structures without group-valued measures ⋮ Turán numbers for Berge-hypergraphs and related extremal problems ⋮ Saturation of Berge hypergraphs ⋮ On grids in point-line arrangements in the plane ⋮ Uniformity thresholds for the asymptotic size of extremal Berge-\(F\)-free hypergraphs ⋮ Many \(T\) copies in \(H\)-free graphs ⋮ Linear saturation numbers of Berge-\(C_3\) and Berge-\(C_4\) ⋮ Relative Turán numbers for hypergraph cycles ⋮ Caps and wickets ⋮ On the Constructor-Blocker game ⋮ Spectral extremal results for hypergraphs ⋮ On Grids in Point-Line Arrangements in the Plane ⋮ Hypergraph based Berge hypergraphs ⋮ Asymptotics for the Turán number of Berge-\(K_{2,t}\) ⋮ Independent Sets in Polarity Graphs ⋮ Small stopping sets in Steiner triple systems ⋮ Counting copies of a fixed subgraph in \(F\)-free graphs ⋮ Generalized Turán problems for complete bipartite graphs ⋮ Hypergraphs with no odd cycle of given length ⋮ On modular \(k\)-free sets ⋮ On the chromatic number of the Erdős-Rényi orthogonal polarity graph ⋮ Ramsey Numbers for Nontrivial Berge Cycles ⋮ Multicolor Ramsey numbers for Berge cycles ⋮ A linear hypergraph extension of Turán's theorem ⋮ The regularity method for graphs with few 4‐cycles
This page was built for publication: On hypergraphs of girth five
