Pages that link to "Item:Q2440004"

The following pages link to On the Erdős-Hajnal problem for 3-uniform hypergraphs (Q2440004):

Displaying 17 items.

• The lifting of graphs to 3-uniform hypergraphs and some applications to hypergraph Ramsey theory (Q329828) (← links)
• On the size of 3-uniform linear hypergraphs (Q396731) (← links)
• Lower bounds for the number of edges in hypergraphs of certain classes (Q630232) (← links)
• The size of minimum 3-trees: Case 2 mod 3 (Q700206) (← links)
• Improvement of the lower bound in the Erdös-Hajnal combinatorial problem (Q736013) (← links)
• On the Erdős-Hajnal problem for 3-graphs (Q2027318) (← links)
• The minimum chromatic spectrum of 3-uniform \(\mathcal{C}\)-hypergraphs (Q2343999) (← links)
• On the construction of 3-chromatic hypergraphs with few edges (Q2349182) (← links)
• A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2 (Q2488941) (← links)
• Tiling 3-uniform hypergraphs with \(K_4^3-2e\) (Q2874094) (← links)
• The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems (Q3116603) (← links)
• Problems and results on 3-chromatic hypergraphs and some related questions (Q4074927) (← links)
• The size of minimum 3-trees: Cases 3 and 4 mod 6 (Q4237725) (← links)
• Any Monotone Property of 3-Uniform Hypergraphs Is Weakly Evasive (Q4922129) (← links)
• On Ordered Ramsey Numbers of Tripartite 3-Uniform Hypergraphs (Q5028353) (← links)
• The intersection spectrum of 3‐chromatic intersecting hypergraphs (Q6051524) (← links)
• A jump to the Narayana number for hereditary properties of ordered 3-uniform hypergraphs (Q6170800) (← links)