Pages that link to "Item:Q630232"
From MaRDI portal
The following pages link to Lower bounds for the number of edges in hypergraphs of certain classes (Q630232):
Displaying 8 items.
- Bounds on the number of edges in hypertrees (Q279202) (← links)
- Improvement of the lower bound in the Erdös-Hajnal combinatorial problem (Q736013) (← links)
- On the construction of 3-chromatic hypergraphs with few edges (Q2349182) (← links)
- The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems (Q3116603) (← links)
- An upper bound on the number of edges of a hypergraph with a given diameter (Q3726160) (← links)
- Colorings of hypergraphs with large number of colors (Q5890912) (← links)
- Colorings of hypergraphs with large number of colors (Q5895162) (← links)
- Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs (Q6046825) (← links)