Pages that link to "Item:Q3055877"
From MaRDI portal
The following pages link to Constructions of sparse uniform hypergraphs with high chromatic number (Q3055877):
Displaying 29 items.
- Quantitative estimates of characteristics for hypergraphs of large girth and large chromatic number (Q268128) (← links)
- Coloring, sparseness and girth (Q312271) (← links)
- On regular hypergraphs with high girth and high chromatic number (Q314149) (← links)
- Dense uniform hypergraphs have high list chromatic number (Q432708) (← links)
- On coloring uniform hypergraphs without 3-cycles (Q446271) (← links)
- On \(r\)-chromatic hypergraphs (Q658071) (← links)
- Improved algorithms for colorings of simple hypergraphs and applications (Q896005) (← links)
- Selective hypergraph colourings (Q906467) (← links)
- A hypergraph-free construction of highly chromatic graphs without short cycles (Q915736) (← links)
- On the chromatic number of simple triangle-free triple systems (Q1010856) (← links)
- Hypergraphs with high chromatic number (Q1086588) (← links)
- Colorings of \(b\)-simple hypergraphs (Q1689874) (← links)
- New construction of graphs with high chromatic number and small clique number (Q1702354) (← links)
- The Cayley isomorphism property for Cayley maps (Q1753007) (← links)
- Coloring cross-intersecting families (Q1753012) (← links)
- New lower bound for the minimal number of edges of simple uniform hypergraph without the property \(B_k\) (Q2088728) (← links)
- High girth hypergraphs with unavoidable monochromatic or rainbow edges (Q2118239) (← links)
- 2-colorings of hypergraphs with large girth (Q2197249) (← links)
- Mycielski type constructions for hypergraphs associated with fractional colorings (Q2254688) (← links)
- Coloring hypergraphs with bounded cardinalities of edge intersections (Q2297713) (← links)
- \((2, 2)\)-colourings and clique-free \(\sigma\)-hypergraphs (Q2341713) (← links)
- Hypergraphs with zero chromatic threshold (Q2631069) (← links)
- Random constructions of hypergraphs with large girth and without panchromatic colorings (Q2671969) (← links)
- Coloring sparse hypergraphs (Q2813339) (← links)
- Random coloring method in the combinatorial problem of Erdős and Lovász (Q3119050) (← links)
- Colourings of Uniform Hypergraphs with Large Girth and Applications (Q4643316) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
- A Combinatorial Classic — Sparse Graphs with High Chromatic Number (Q5416086) (← links)
- Colorings of hypergraphs with large number of colors (Q5895162) (← links)
