Pages that link to "Item:Q1594601"
From MaRDI portal
The following pages link to On edge colorings with at least \(q\) colors in every subset of \(p\) vertices (Q1594601):
Displaying 17 items.
- More distinct distances under local conditions (Q722329) (← links)
- A variant of the classical Ramsey problem (Q1280270) (← links)
- Edge-coloring cliques with three colors on all 4-cliques (Q1280308) (← links)
- Generalized Ramsey numbers: forbidding paths with few colors (Q2309212) (← links)
- The Erdős-Gyárfás problem on generalized Ramsey numbers (Q2940075) (← links)
- Subgraphs with all colours in a line-coloured graph (Q4111595) (← links)
- An application of the regularity lemma in generalized Ramsey theory (Q4434547) (← links)
- Color Isomorphic Even Cycles and a Related Ramsey Problem (Q5128499) (← links)
- Local Properties via Color Energy Graphs and Forbidden Configurations (Q5208745) (← links)
- Edge-coloring cliques with many colors on subcliques (Q5928597) (← links)
- Every subcubic multigraph is (1,27) $(1,{2}^{7})$‐packing edge‐colorable (Q6062875) (← links)
- Rainbow subgraphs in edge-colored planar and outerplanar graphs (Q6063835) (← links)
- Lower bounds on the Erdős–Gyárfás problem via color energy graphs (Q6074587) (← links)
- The Erdős–Gyárfás function with respect to Gallai‐colorings (Q6081587) (← 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)
