Quadruple systems with independent neighborhoods

DOI10.1016/j.jcta.2008.01.008zbMath1190.05036OpenAlexW2058246733MaRDI QIDQ958757

Oleg Pikhurko, Dhruv Mubayi, Zoltan Fueredi

Publication date: 8 December 2008

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2008.01.008

zbMATH Keywords

Turán problem\(k\)-graphindependent neighborhoods

Mathematics Subject Classification ID

Other designs, configurations (05B30)

Related Items (9)

Almost all triple systems with independent neighborhoods are semi-bipartite ⋮ The minimum size of 3-graphs without a 4-set spanning no or exactly three edges ⋮ Hypergraphs with independent neighborhoods ⋮ Turán problems on non-uniform hypergraphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Counting substructures. II: Hypergraphs ⋮ On independent sets in hypergraphs ⋮ Stability results for random discrete structures ⋮ Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• On the Turán number of triple systems
• The Turán density of the hypergraph \(\{abc,ade,bde,cde\}\)
• On a hypergraph Turán problem of Frankl
• On Triple Systems with Independent Neighbourhoods

This page was built for publication: Quadruple systems with independent neighborhoods