Pages that link to "Item:Q4554774"
From MaRDI portal
The following pages link to A (5,5)-Colouring of <i>K</i><sub><i>n</i></sub> with Few Colours (Q4554774):
Displaying 10 items.
- The optimal drawings of \(K_{5,n}\) (Q463036) (← links)
- \(K_ 5\) is the only double-critical 5-chromatic graph (Q1088672) (← links)
- Edge-coloring cliques with three colors on all 4-cliques (Q1280308) (← links)
- An explicit edge-coloring of \(K_n\) with six colors on every \(K_5\) (Q2327227) (← links)
- New upper bounds for the Erdős-Gyárfás problem on generalized Ramsey numbers (Q5885201) (← links)
- Edge-coloring cliques with many colors on subcliques (Q5928597) (← links)
- Lower bounds on the Erdős–Gyárfás problem via color energy graphs (Q6074587) (← links)
- New bounds on the generalized Ramsey number \(f(n, 5, 8)\) (Q6542039) (← links)
- The Erdős-Gyárfás function \(f(n, 4, 5) = \frac{5}{6} n + o(n)\) -- so Gyárfás was right (Q6615756) (← links)
- Growth rates of the bipartite Erdős-Gyárfás function (Q6642509) (← links)
