Rainbow generalizations of Ramsey theory: A survey
From MaRDI portal
Publication:604649
DOI10.1007/S00373-010-0891-3zbMATH Open1231.05178OpenAlexW2033599053WikidataQ105583446 ScholiaQ105583446MaRDI QIDQ604649FDOQ604649
Colton Magnant, Shinya Fujita, Kenta Ozeki
Publication date: 12 November 2010
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-010-0891-3
Cites Work
- Normal hypergraphs and the perfect graph conjecture
- On maximal paths and circuits of graphs
- Title not available (Why is that?)
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
- Title not available (Why is that?)
- Polychromatic Hamilton cycles
- The strong perfect graph theorem
- Transitiv orientierbare Graphen
- Rainbow numbers for cycles with pendant edges
- Bipartite rainbow numbers of matchings
- A rainbow \(k\)-matching in the complete graph with \(r\) colors
- Edge-colorings with no large polychromatic stars
- Rainbow numbers for matchings and complete graphs
- An anti-Ramsey theorem on cycles
- Bipartite anti-Ramsey numbers of cycles
- On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle
- Title not available (Why is that?)
- Rainbows in the hypercube
- A Combinatorial Theorem
- Combinatorial Theorems on Classifications of Subsets of a Given Set
- Chromatic graph theory
- On restricted colourings of \(K_ n\)
- Title not available (Why is that?)
- Turán’s Theorem in the Hypercube
- Colorings of planar graphs with no rainbow faces
- An Upper Bound on Zarankiewicz' Problem
- On Ramsey families of sets
- On a heterochromatic number for hypercubes
- Edge-colorings avoiding rainbow and monochromatic subgraphs
- Ramsey-type results for Gallai colorings
- Title not available (Why is that?)
- Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
- Edge colorings of complete graphs without tricolored triangles
- Minimal colorings for properly colored subgraphs
- On totally multicolored stars
- A note on perfect graphs
- On rainbow arithmetic progressions
- Coloured solutions of equations in finite groups
- Extensions of Gallai-Ramsey results
- Rainbow Arithmetic Progressions and Anti-Ramsey Results
- An anti-Ramsey theorem
- Constrained Ramsey numbers of graphs
- On an anti‐Ramsey property of Ramanujan graphs
- New upper bounds for a canonical Ramsey problem
- Nonrepetitive colorings of graphs of bounded tree-width
- Title not available (Why is that?)
- Title not available (Why is that?)
- Anti-Ramsey numbers of subdivided graphs
- Anti-Ramsey numbers for graphs with independent cycles
- Fruit salad
- On pattern Ramsey numbers of graphs
- Gallai-Ramsey numbers for cycles
- Edge-colored complete graphs with precisely colored subgraphs
- Sub-Ramsey numbers of arithmetic progressions
- Ramsey numbers for local colorings
- Local \(k\)-colorings of graphs and hypergraphs
- More star sub-Ramsey numbers
- A variant of the classical Ramsey problem
- Edge-coloring cliques with three colors on all 4-cliques
- Finding large \(p\)-colored diameter two subgraphs
- On canonical Ramsey numbers for complete graphs versus paths
- A linear heterochromatic number of graphs
- Bipartite rainbow Ramsey numbers.
- A generalized Ramsey problem
- On Erdős-Rado numbers
- On restricted edge-colorings of bicliques
- On generalized Ramsey theory: The bipartite case
- Anti-Ramsey colorings in several rounds
- Polychromatic cliques
- Multicolored subsets in colored hypergraphs
- On colorings avoiding a rainbow cycle and a fixed monochromatic subgraph
- A decomposition of Gallai multigraphs
- Canonical pattern Ramsey numbers
- Totally multicoloured cycles
- Long heterochromatic paths in heterochromatic triangle free graphs
- Title not available (Why is that?)
- Finding a monochromatic subgraph or a rainbow path
- Rainbow numbers for certain graphs
- Some Ramsey and anti–Ramsey results in finite groups
- Anti-Ramsey numbers of doubly edge-critical graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lambda composition
- Title not available (Why is that?)
- Local Anti-Ramsey Numbers of Graphs
- Title not available (Why is that?)
- Maximal antiramsey graphs and the strong chromatic number
- Title not available (Why is that?)
- On an anti‐Ramsey problem of Burr, Erdős, Graham, and T. Sós
- An anti-Ramsey Theorem on edge-cutsets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generalizations of some Ramsey-type theorems for matchings
- On a generalized anti-Ramsey problem
- Mono-multi bipartite Ramsey numbers, designs, and matrices
- Sub-Ramsey numbers for arithmetic progressions
- Colored graphs without colorful cycles
Cited In (only showing first 100 items - show all)
- Anti-Ramsey number of matchings in hypergraphs
- A conjecture on Gallai-Ramsey numbers of even cycles and paths
- On odd rainbow cycles in edge-colored graphs
- Gallai-Ramsey numbers of \(C_7\) with multiple colors
- On an anti-Ramsey threshold for random graphs
- Gallai and \(\ell \)-uniform Ramsey numbers of complete bipartite graphs
- On the maximal colorings of complete graphs without some small properly colored subgraphs
- Complete graphs and complete bipartite graphs without rainbow path
- Rainbow \(C_3\)'s and \(C_4\)'s in edge-colored graphs
- Star-critical Gallai-Ramsey numbers of graphs
- $(g,f)$-Chromatic spanning trees and forests
- On the anti-Ramsey number of forests
- The Erdős-Hajnal conjecture for rainbow triangles
- Rainbow Numbers for Cycles in Plane Triangulations
- Title not available (Why is that?)
- Non-monochromatic triangles in a 2-edge-coloured graph
- Monochromatic stars in rainbow \(K_3\)-free and \(S_3^+\)-free colorings
- Gallai-Ramsey numbers for rainbow \(S_3^+\) and monochromatic paths
- Anti-Ramsey numbers in complete split graphs
- Improved bounds for rainbow numbers of matchings in plane triangulations
- Rainbow numbers for matchings in plane triangulations
- Anti-Ramsey numbers for matchings in 3-regular bipartite graphs
- Anti-Ramsey number of Hanoi graphs
- Rainbow Ramsey simple structures
- Facial rainbow edge-coloring of plane graphs
- Gallai-Ramsey numbers for monochromatic triangles or 4-cycles
- Monochromatic subgraphs in the absence of a properly colored 4-cycle
- Gallai-Ramsey numbers involving a rainbow 4-path
- Anti-powers in infinite words
- Rainbow spanning subgraphs of small diameter in edge-colored complete graphs
- Vertex colorings without rainbow subgraphs
- Gallai-Ramsey numbers of odd cycles and complete bipartite graphs
- Rainbow numbers for graphs containing small cycles
- Maximum number of colors: C-coloring and related problems
- Anti-Ramsey problems for cycles
- Sub-Ramsey numbers for matchings
- Gallai-Ramsey numbers for books
- A note on Gallai-Ramsey number of even wheels
- Gallai colorings and domination in multipartite digraphs
- Bounds for bipartite rainbow Ramsey numbers
- Rainbow cliques in edge-colored graphs
- Rainbow triangles in arc-colored tournaments
- Anti-Ramsey number of triangles in complete multipartite graphs
- Extremal coloring for the anti-Ramsey problem of matchings in complete graphs
- Anti-Ramsey numbers for matchings in regular bipartite graphs
- Anti-Ramsey numbers for vertex-disjoint triangles
- Improved upper bounds for Gallai-Ramsey numbers of paths and cycles
- Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs
- On degree anti-Ramsey numbers
- Rainbow number of matchings in planar graphs
- Transversals in generalized Latin squares
- Approximation and hardness results for the maximum edge \(q\)-coloring problem
- Rainbow matchings in edge-colored complete split graphs
- Connected colourings of complete graphs and hypergraphs
- On the anti-Ramsey numbers of linear forests
- A decomposition of Gallai multigraphs
- Anti-Ramsey coloring for matchings in complete bipartite graphs
- Anti-Ramsey problems for \(t\) edge-disjoint rainbow spanning subgraphs: cycles, matchings, or trees
- All partitions have small parts -- Gallai-Ramsey numbers of bipartite graphs
- Rainbow connection and graph products
- Constructive Methods in Gallai-Ramsey Theory for Hypergraphs
- Anti-Ramsey number of matchings in a hypergraph
- Extremal problems and results related to Gallai-colorings
- The anti-Ramsey numbers of \(C_3\) and \(C_4\) in complete \(r\)-partite graphs
- Title not available (Why is that?)
- On sufficient conditions for rainbow cycles in edge-colored graphs
- Avoiding rainbow 2-connected subgraphs
- Complexity of Computing the Anti-Ramsey Numbers for Paths.
- Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees
- Further approximations for Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture
- Gallai-Ramsey numbers for rainbow paths
- Gallai-Ramsey numbers for graphs with chromatic number three
- Anti-Ramsey number of matchings in outerplanar graphs
- Ramsey and Gallai-Ramsey number for wheels
- Ramsey and Gallai-Ramsey numbers for stars with extra independent edges
- Gallai-Ramsey numbers for a class of graphs with five vertices
- On the balanced upper chromatic number of cyclic projective planes and projective spaces
- Rainbow numbers for paths in planar graphs
- Gallai-Ramsey numbers of $C_{10}$ and $C_{12}$
- Gallai-Ramsey numbers for graphs with five vertices of chromatic number four
- Rainbow numbers for small graphs in planar graphs
- Gallai-Ramsey multiplicity for rainbow small trees
- Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs
- Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning trees
- Ramsey and Gallai-Ramsey numbers for two classes of unicyclic graphs
- On perfect balanced rainbow-free colorings and complete colorings of projective spaces
- Constrained Ramsey numbers for the loose path, cycle and star
- Implications in rainbow forbidden subgraphs
- On \(\mathrm{M}_f\)-edge colorings of graphs
- Anti-van der Waerden numbers on graphs
- Anti-Ramsey number of disjoint union of star-like hypergraphs
- New bounds on the anti-Ramsey numbers of star graphs via maximum edge \(q\)-coloring
- On rainbow-cycle-forbidding edge colorings of finite graphs
- Rainbow triangles in edge-colored Kneser graphs
- On rainbow matchings in plane triangulations
- Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings
- Gallai-Ramsey numbers for rainbow \(P_5\) and monochromatic fans or wheels
- Gallai-Ramsey numbers for paths
- Complete edge-colored permutation graphs
- Gallai-Ramsey number for the union of stars
This page was built for publication: Rainbow generalizations of Ramsey theory: A survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q604649)
