A generalized Ramsey problem
From MaRDI portal
DOI10.1016/S0012-365X(00)00052-2zbMATH Open0969.05042OpenAlexW2044397349MaRDI QIDQ1579567FDOQ1579567
Authors: Maria Axenovich 
Publication date: 14 September 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00052-2
Recommendations
Cited In (27)
- The Erdős–Gyárfás function with respect to Gallai‐colorings
- The sub-exponential transition for the chromatic generalized Ramsey numbers
- Color isomorphic even cycles and a related Ramsey problem
- An explicit edge-coloring of \(K_n\) with six colors on every \(K_5\)
- Generalizing the Ramsey problem through diameter
- Title not available (Why is that?)
- Multiple vertex coverings by cliques
- An explicit construction for a Ramsey problem
- Generalized Ramsey numbers: forbidding paths with few colors
- Rainbow generalizations of Ramsey theory: A survey
- A (5,5)-Colouring of Kn with Few Colours
- New upper bounds for a canonical Ramsey problem
- Totally Multicolored diamonds
- On four color monochromatic sets with nondecreasing diameter
- A mixed Ramsey problem revisited
- Edge colorings avoiding patterns
- The Erdős-Gyárfás function \(f(n, 4, 5) = \frac{5}{6} n + o(n)\) -- so Gyárfás was right
- Ramsey theory constructions from hypergraph matchings
- On a generalized anti-Ramsey problem
- An application of the regularity lemma in generalized Ramsey theory
- Proper Ramsey numbers of graphs
- Growth rates of the bipartite Erdős-Gyárfás function
- On generalized Ramsey theory: The bipartite case
- An anti-Ramsey theorem on cycles
- Ramsey-type problem for an almost monochromatic \(K_4\)
- Title not available (Why is that?)
- New bounds on the generalized Ramsey number \(f(n, 5, 8)\)
This page was built for publication: A generalized Ramsey problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1579567)
