Pages that link to "Item:Q705745"
From MaRDI portal
The following pages link to An explicit construction for a Ramsey problem (Q705745):
Displaying 20 items.
- A construction for Ramsey numbers for \(K_{m,n}\) (Q709236) (← links)
- Edge-colorings avoiding rainbow and monochromatic subgraphs (Q942100) (← links)
- Weighted arcs, the finite Radon transform and a Ramsey problem (Q1175558) (← links)
- A generalized Ramsey problem (Q1579567) (← links)
- A simple and non-trivial Ramsey test (Q2093022) (← links)
- An explicit edge-coloring of \(K_n\) with six colors on every \(K_5\) (Q2327227) (← links)
- On colorful edge triples in edge-colored complete graphs (Q2657036) (← links)
- Coloring triple systems with local conditions (Q2800545) (← links)
- Ramsey classes: examples and constructions (Q3179071) (← links)
- When is an Almost Monochromatic<i>K</i><sub>4</sub>Guaranteed? (Q3608338) (← links)
- Colorings generated by monotone properties (Q4379726) (← links)
- A (5,5)-Colouring of <i>K</i><sub><i>n</i></sub> with Few Colours (Q4554774) (← links)
- Explicit Construction of RIP Matrices Is Ramsey‐Hard (Q5134211) (← links)
- Explicit constructions of triple systems for Ramsey–Turán problems (Q5486274) (← links)
- New upper bounds for the Erdős-Gyárfás problem on generalized Ramsey numbers (Q5885201) (← 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)
- Ramsey theory constructions from hypergraph matchings (Q6621271) (← links)
- Growth rates of the bipartite Erdős-Gyárfás function (Q6642509) (← links)
