On the Erdős-Hajnal problem for 3-uniform hypergraphs

DOI10.1134/S000143461311031XzbMATH Open1294.05068MaRDI QIDQ2440004FDOQ2440004

I. A. Akolzin

Publication date: 26 March 2014

Published in: Mathematical Notes (Search for Journal in Brave)

Recommendations

• On the Erdős-Hajnal problem for 3-graphs
• On Frankl and Füredi's conjecture for 3-uniform hypergraphs
• On a 3-uniform hypergraph coloring problem in the integers
• A Motzkin-Straus type result for 3-uniform hypergraphs
• On generalized Ramsey numbers for 3-uniform hypergraphs
• On the size of 3-uniform linear hypergraphs
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• On the vertex cover number of 3-uniform hypergraph
• On a Turán problem in weakly quasirandom 3-uniform hypergraphs
• A problem of Erdős and Sós on 3-graphs

zbMATH Keywords

hypergraphcoloring\(n\)-uniform hypergraph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Cites Work

• What we know and what we do not know about Turán numbers
• The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems
• On a property of families of sets
• Title not available (Why is that?)
• On the minimum size of 4-uniform hypergraphs without property \(B\)
• Title not available (Why is that?)

Cited In (12)

• On the size of 3-uniform linear hypergraphs
• The size of minimum 3-trees: Case 2 mod 3
• Improvement of the lower bound in the Erdös-Hajnal combinatorial problem
• The intersection spectrum of 3‐chromatic intersecting hypergraphs
• Title not available (Why is that?)
• A jump to the Narayana number for hereditary properties of ordered 3-uniform hypergraphs
• On Ordered Ramsey Numbers of Tripartite 3-Uniform Hypergraphs
• The lifting of graphs to 3-uniform hypergraphs and some applications to hypergraph Ramsey theory
• Tiling 3-uniform hypergraphs with \(K_4^3-2e\)
• Any Monotone Property of 3-Uniform Hypergraphs Is Weakly Evasive
• A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2
• On the Erdős-Hajnal problem for 3-graphs

This page was built for publication: On the Erdős-Hajnal problem for 3-uniform hypergraphs

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