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




Related Items (48)

Turán numbers for hypergraph star forestsNearly-Regular Hypergraphs and Saturation of Berge StarsMinimal paths and cycles in set systemsTriangle-free induced subgraphs of the unitary polarity graphProof of a conjecture on monomial graphsThe linear Turán number of small triple systems or why is the wicket interesting?3-uniform hypergraphs without a cycle of length fiveConnectivity of some algebraically defined digraphsOn \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\)Triangles in C5‐free graphs and hypergraphs of girth sixOn regular hypergraphs of high girthCounting hypergraphs with large girthLinearity of saturation for Berge hypergraphsHypergraphs with no cycle of length 4Improved lower bounds for multiplicative square-free sequencesBook free 3-uniform hypergraphsOn \(3\)-uniform hypergraphs avoiding a cycle of length fourExtremal Results for Berge HypergraphsAsymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs3-uniform hypergraphs avoiding a given odd cycleSparse Hypergraphs with Applications to Coding Theory\(k\)-fold Sidon setsA counterexample to sparse removalA linear hypergraph extension of the bipartite Turán problemLinear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey NumbersPentagons vs. trianglesQuantum structures without group-valued measuresTurán numbers for Berge-hypergraphs and related extremal problemsSaturation of Berge hypergraphsOn grids in point-line arrangements in the planeUniformity thresholds for the asymptotic size of extremal Berge-\(F\)-free hypergraphsMany \(T\) copies in \(H\)-free graphsRelative Turán numbers for hypergraph cyclesSpectral extremal results for hypergraphsOn Grids in Point-Line Arrangements in the PlaneHypergraph based Berge hypergraphsAsymptotics for the Turán number of Berge-\(K_{2,t}\)Independent Sets in Polarity GraphsSmall stopping sets in Steiner triple systemsCounting copies of a fixed subgraph in \(F\)-free graphsGeneralized Turán problems for complete bipartite graphsHypergraphs with no odd cycle of given lengthOn modular \(k\)-free setsOn the chromatic number of the Erdős-Rényi orthogonal polarity graphRamsey Numbers for Nontrivial Berge CyclesMulticolor Ramsey numbers for Berge cyclesA linear hypergraph extension of Turán's theoremThe regularity method for graphs with few 4‐cycles




This page was built for publication: On hypergraphs of girth five