Pages that link to "Item:Q3116603"
From MaRDI portal
The following pages link to The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems (Q3116603):
Displaying 38 items.
- On algorithmic methods of analysis of two-colorings of hypergraphs (Q291223) (← links)
- Equitable colorings of non-uniform simple hypergraphs (Q322355) (← links)
- Equitable colorings of nonuniform hypergraphs (Q325641) (← links)
- Van der Waerden function and colorings of hypergraphs with large girth (Q382207) (← links)
- Independence numbers and chromatic numbers of random subgraphs in some sequences of graphs (Q483670) (← links)
- On two-colorings of hypergraphs (Q656242) (← links)
- Improved algorithms for colorings of simple hypergraphs and applications (Q896005) (← links)
- Hypergraphs with high chromatic number (Q1086588) (← links)
- Development of hypergraph theory (Q1647456) (← links)
- Colorings of \(b\)-simple hypergraphs (Q1689874) (← links)
- A note on panchromatic colorings (Q1690224) (← links)
- Upper bound in the Erdős-Hajnal problem of hypergraph coloring (Q1947784) (← links)
- On the Erdős-Hajnal problem for 3-graphs (Q2027318) (← 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)
- DP-colorings of uniform hypergraphs and splittings of Boolean hypercube into faces (Q2170789) (← links)
- The list-chromatic number of complete multipartite hypergraphs and multiple covers by independent sets (Q2191992) (← links)
- 2-colorings of hypergraphs with large girth (Q2197249) (← links)
- On colorings of 3-homogeneous hypergraphs in 3 colors (Q2206279) (← links)
- On equitable colorings of hypergraphs (Q2291188) (← links)
- Coloring hypergraphs with bounded cardinalities of edge intersections (Q2297713) (← links)
- Around Erdős-Lovász problem on colorings of non-uniform hypergraphs (Q2352063) (← links)
- A generalization of the Hajnal-Szemerédi theorem for uniform hypergraphs (Q2353014) (← links)
- On the Erdős-Hajnal problem for 3-uniform hypergraphs (Q2440004) (← links)
- Equitable colorings of hypergraphs with \(r\) colors (Q2671950) (← links)
- On some generalizations of the property B problem of an \(n\)-uniform hypergraph (Q2671957) (← links)
- Random constructions of hypergraphs with large girth and without panchromatic colorings (Q2671969) (← links)
- On the problem of Erdős and Hajnal in the case of list colorings (Q2851493) (← links)
- Regular Behavior of the Maximal Hypergraph Chromatic Number (Q3300758) (← links)
- A note on random greedy coloring of uniform hypergraphs (Q3452724) (← links)
- Multipass greedy coloring of simple uniform hypergraphs (Q3467582) (← links)
- (Q4401989) (← links)
- Extremal problems in hypergraph colourings (Q5112450) (← links)
- The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques (Q5360466) (← links)
- Sperner's Colorings, Hypergraph Labeling Problems and Fair Division (Q5363096) (← links)
- The Erdõs-Hadwiger problem and the chromatic numbers of finite geometric graphs (Q5693810) (← links)
- Colorings of hypergraphs with large number of colors (Q5890912) (← links)
- Colorings of hypergraphs with large number of colors (Q5895162) (← links)
