Rainbow generalizations of Ramsey theory: A survey
From MaRDI portal
Publication:604649
Cites work
- scientific article; zbMATH DE number 6004047 (Why is no real title available?)
- scientific article; zbMATH DE number 426321 (Why is no real title available?)
- scientific article; zbMATH DE number 2131198 (Why is no real title available?)
- scientific article; zbMATH DE number 3972895 (Why is no real title available?)
- scientific article; zbMATH DE number 4023328 (Why is no real title available?)
- scientific article; zbMATH DE number 2059948 (Why is no real title available?)
- scientific article; zbMATH DE number 2148774 (Why is no real title available?)
- scientific article; zbMATH DE number 2124068 (Why is no real title available?)
- scientific article; zbMATH DE number 881164 (Why is no real title available?)
- scientific article; zbMATH DE number 2192164 (Why is no real title available?)
- scientific article; zbMATH DE number 2197938 (Why is no real title available?)
- scientific article; zbMATH DE number 3285073 (Why is no real title available?)
- scientific article; zbMATH DE number 2230293 (Why is no real title available?)
- scientific article; zbMATH DE number 2230310 (Why is no real title available?)
- scientific article; zbMATH DE number 3041944 (Why is no real title available?)
- A Combinatorial Theorem
- A decomposition of Gallai multigraphs
- A generalized Ramsey problem
- A linear heterochromatic number of graphs
- A note on perfect graphs
- A rainbow \(k\)-matching in the complete graph with \(r\) colors
- A variant of the classical Ramsey problem
- An Upper Bound on Zarankiewicz' Problem
- An anti-Ramsey Theorem on edge-cutsets
- An anti-Ramsey theorem
- An anti-Ramsey theorem on cycles
- Anti-Ramsey colorings in several rounds
- Anti-Ramsey numbers for graphs with independent cycles
- Anti-Ramsey numbers of doubly edge-critical graphs
- Anti-Ramsey numbers of subdivided graphs
- Bipartite anti-Ramsey numbers of cycles
- Bipartite rainbow Ramsey numbers.
- Bipartite rainbow numbers of matchings
- Canonical pattern Ramsey numbers
- Chromatic graph theory
- Colored graphs without colorful cycles
- Colorings of planar graphs with no rainbow faces
- Coloured solutions of equations in finite groups
- Combinatorial Theorems on Classifications of Subsets of a Given Set
- Constrained Ramsey numbers of graphs
- Edge colorings of complete graphs without tricolored triangles
- Edge-colored complete graphs with precisely colored subgraphs
- Edge-coloring cliques with three colors on all 4-cliques
- Edge-colorings avoiding rainbow and monochromatic subgraphs
- Edge-colorings with no large polychromatic stars
- Extensions of Gallai-Ramsey results
- Finding a monochromatic subgraph or a rainbow path
- Finding large \(p\)-colored diameter two subgraphs
- Fruit salad
- Gallai-Ramsey numbers for cycles
- Generalizations of some Ramsey-type theorems for matchings
- Lambda composition
- Local Anti-Ramsey Numbers of Graphs
- Local k-colorings of graphs and hypergraphs
- Long heterochromatic paths in heterochromatic triangle free graphs
- Maximal antiramsey graphs and the strong chromatic number
- Minimal colorings for properly colored subgraphs
- Mono-multi bipartite Ramsey numbers, designs, and matrices
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- More star sub-Ramsey numbers
- Multicolored subsets in colored hypergraphs
- New upper bounds for a canonical Ramsey problem
- Nonrepetitive colorings of graphs of bounded tree-width
- Normal hypergraphs and the perfect graph conjecture
- On Erdős-Rado numbers
- On Ramsey families of sets
- On a generalized anti-Ramsey problem
- On a heterochromatic number for hypercubes
- On an anti‐Ramsey problem of Burr, Erdős, Graham, and T. Sós
- On an anti‐Ramsey property of Ramanujan graphs
- On canonical Ramsey numbers for complete graphs versus paths
- On colorings avoiding a rainbow cycle and a fixed monochromatic subgraph
- On generalized Ramsey theory: The bipartite case
- On maximal paths and circuits of graphs
- On pattern Ramsey numbers of graphs
- On rainbow arithmetic progressions
- On restricted colourings of \(K_ n\)
- On restricted edge-colorings of bicliques
- On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle
- On totally multicolored stars
- Path and cycle sub-Ramsey numbers and an edge-colouring conjecture
- Polychromatic Hamilton cycles
- Polychromatic cliques
- Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
- Rainbow Arithmetic Progressions and Anti-Ramsey Results
- Rainbow numbers for certain graphs
- Rainbow numbers for cycles with pendant edges
- Rainbow numbers for matchings and complete graphs
- Rainbows in the hypercube
- Ramsey numbers for local colorings
- Ramsey-type results for Gallai colorings
- Some Ramsey and anti–Ramsey results in finite groups
- Sub-Ramsey numbers for arithmetic progressions
- Sub-Ramsey numbers of arithmetic progressions
- The strong perfect graph theorem
- Totally multicoloured cycles
- Transitiv orientierbare Graphen
- Turán’s Theorem in the Hypercube
Cited in
(only showing first 100 items - show all)- Connected colourings of complete graphs and hypergraphs
- Gallai-Ramsey numbers for fans
- Anti-Ramsey number of the star and matching family
- Improved bounds for anti-Ramsey numbers of matchings in outer-planar graphs
- Large Rainbow Cliques in Randomly Perturbed Dense Graphs
- Parameterized algorithms and hardness for the maximum edge q-coloring problem
- On the anti-Ramsey numbers of linear forests
- Size Gallai-Ramsey number
- Weakened Gallai-Ramsey number for various graphs of order up to six
- Tight bounds for rainbow partial F-tiling in edge-colored complete hypergraphs
- Gallai-Ramsey number of odd cycles with chords
- Anti-Ramsey coloring for matchings in complete bipartite graphs
- Anti-Ramsey numbers for disjoint copies of graphs
- A decomposition of Gallai multigraphs
- Anti-Ramsey numbers for cycles in the generalized Petersen 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
- Anti-Ramsey numbers of loose paths and cycles in uniform hypergraphs
- Colorful Borsuk-Ulam theorems and applications
- Transitive and Gallai colorings of the complete graph
- Rainbow connection and graph products
- Exact rainbow numbers for matchings in plane triangulations
- Extremal problems and results related to Gallai-colorings
- The anti-Ramsey numbers of \(C_3\) and \(C_4\) in complete \(r\)-partite graphs
- The Boolean rainbow Ramsey number of antichains, Boolean posets and chains
- Anti-Ramsey number of matchings in a hypergraph
- The Erdős-Hajnal conjecture for three colors and triangles
- Anti-Ramsey numbers of paths and cycles in hypergraphs
- Constructive Methods in Gallai-Ramsey Theory for Hypergraphs
- scientific article; zbMATH DE number 5014483 (Why is no real title available?)
- Euclidean Gallai-Ramsey for various configurations
- Disproof of a conjecture on the rainbow triangles in arc-colored digraphs
- Note on rainbow triangles in edge-colored graphs
- On sufficient conditions for rainbow cycles in edge-colored graphs
- Rainbow triangles in arc-colored digraphs
- Avoiding rainbow 2-connected subgraphs
- Anti-Ramsey number of matchings in hypergraphs
- A conjecture on Gallai-Ramsey numbers of even cycles and paths
- Complexity of Computing the Anti-Ramsey Numbers for Paths.
- On odd rainbow cycles in edge-colored graphs
- On an anti-Ramsey threshold for random graphs
- Gallai-Ramsey numbers of C₇ with multiple colors
- Anti-Ramsey numbers of cycles of length three in uniform hypergraphs
- Gallai and \(\ell \)-uniform Ramsey numbers of complete bipartite graphs
- On the maximal colorings of complete graphs without some small properly colored subgraphs
- Further approximations for Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture
- Rainbow \(C_3\)'s and \(C_4\)'s in edge-colored graphs
- Complete graphs and complete bipartite graphs without rainbow path
- Gallai-Ramsey numbers for rainbow paths
- Gallai-Ramsey numbers for graphs with chromatic number three
- Hypergraph anti-Ramsey theorems
- Star-critical Gallai-Ramsey numbers of graphs
- On the anti-Ramsey number of forests
- Anti-Ramsey number of matchings in outerplanar graphs
- The Erdős-Hajnal conjecture for rainbow triangles
- Non-monochromatic triangles in a 2-edge-coloured graph
- Monochromatic stars in rainbow \(K_3\)-free and \(S_3^+\)-free colorings
- Ramsey and Gallai-Ramsey number for wheels
- scientific article; zbMATH DE number 5202630 (Why is no real title available?)
- Anti-Ramsey numbers in complete split graphs
- Ramsey and Gallai-Ramsey numbers for stars with extra independent edges
- Gallai-Ramsey numbers for rainbow \(S_3^+\) and monochromatic paths
- Gallai-Ramsey numbers for a class of graphs with five vertices
- On the balanced upper chromatic number of cyclic projective planes and projective spaces
- Improved bounds for rainbow numbers of matchings in plane triangulations
- Rainbow transitive triangles in arc-colored digraphs
- Rainbow numbers for matchings in plane triangulations
- Note on the anti-Ramsey number for matching in hypercubes
- Anti-Ramsey numbers for matchings in 3-regular bipartite graphs
- On edge colorings of graphs with no color-rich cycles
- Ramsey and Gallai-Ramsey numbers of cycles and books
- Highly irregular
- Anti-Ramsey number of Hanoi graphs
- Rainbow Ramsey simple structures
- Rainbow numbers for paths in planar graphs
- Rainbow spanning subgraphs of small diameter in edge-colored complete graphs
- 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
- Vertex colorings without rainbow subgraphs
- Anti-powers in infinite words
- Rainbow numbers for small graphs in planar graphs
- Gallai-Ramsey numbers involving a rainbow 4-path
- Gallai-Ramsey multiplicity for rainbow small trees
- Gallai-Ramsey numbers of odd cycles and complete bipartite graphs
- 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
- Properly colored cycles in edge-colored complete graphs
- Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs
- Rainbow numbers for graphs containing small cycles
- Maximum number of colors: C-coloring and related problems
- On perfect balanced rainbow-free colorings and complete colorings of projective spaces
- Anti-Ramsey problems for cycles
- Anti-Ramsey number of edge-disjoint rainbow spanning trees
- Sub-Ramsey numbers for matchings
- Constrained Ramsey numbers for the loose path, cycle and star
- Gallai-Ramsey numbers for books
- A note on Gallai-Ramsey number of even wheels
- \((g,f)\)-chromatic spanning trees and forests
- Implications in rainbow forbidden subgraphs
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)
