Pages that link to "Item:Q736013"
From MaRDI portal
The following pages link to Improvement of the lower bound in the Erdös-Hajnal combinatorial problem (Q736013):
Displaying 6 items.
- Lower bounds for the number of edges in hypergraphs of certain classes (Q630232) (← links)
- On two-colorings of hypergraphs (Q656242) (← links)
- On \(r\)-chromatic hypergraphs (Q658071) (← links)
- Coloring non-uniform hypergraphs without short cycles (Q742641) (← links)
- Random coloring method in the combinatorial problem of Erdős and Lovász (Q3119050) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
