On Triple Systems with Independent Neighbourhoods
From MaRDI portal
Publication:5704391
DOI10.1017/S0963548305006905zbMath1079.05062OpenAlexW2126528093MaRDI QIDQ5704391
Oleg Pikhurko, Zoltan Fueredi, Miklós Simmonovits
Publication date: 14 November 2005
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548305006905
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Extremal set theory (05D05) Coloring of graphs and hypergraphs (05C15)
Related Items (25)
An intersection theorem for four sets ⋮ The Codegree Threshold for 3-Graphs with Independent Neighborhoods ⋮ On the codegree density of complete 3-graphs and related problems ⋮ On Turán densities of small triple graphs ⋮ On the Turán density of uniform hypergraphs ⋮ Some Cubic Time Regularity Algorithms for Triple Systems ⋮ Almost all triple systems with independent neighborhoods are semi-bipartite ⋮ On the Chromatic Thresholds of Hypergraphs ⋮ Stability and Turán Numbers of a Class of Hypergraphs via Lagrangians ⋮ New lower bounds for the Turán density of \(PG_m(q)\) ⋮ Hypergraphs with independent neighborhoods ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Counting substructures. II: Hypergraphs ⋮ Constructions of non-principal families in extremal hypergraph theory ⋮ Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs ⋮ On independent sets in hypergraphs ⋮ Quadruple systems with independent neighborhoods ⋮ Stability results for random discrete structures ⋮ Set systems without a simplex or a cluster ⋮ Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs ⋮ Combinatorial Problems for Horn Clauses ⋮ Triangle-degrees in graphs and tetrahedron coverings in 3-graphs ⋮ Independent sets in hypergraphs ⋮ On the Codegree Density of $PG_m(q)$ ⋮ A hypergraph Turán problem with no stability
This page was built for publication: On Triple Systems with Independent Neighbourhoods