Edge-colored complete graphs with precisely colored subgraphs
From MaRDI portal
(Redirected from Publication:787167)
Cites work
Cited in
(58)- A conjecture on Gallai-Ramsey numbers of even cycles and paths
- The Erdős–Gyárfás function with respect to Gallai‐colorings
- Gallai-Ramsey numbers of C₇ with multiple colors
- Gallai and \(\ell \)-uniform Ramsey numbers of complete bipartite graphs
- Complete graphs and complete bipartite graphs without rainbow path
- Gallai-Ramsey numbers for graphs with chromatic number three
- Properly edge-colored theta graphs in edge-colored complete graphs
- Gallai-Ramsey numbers for cycles
- The Erdős-Hajnal conjecture for rainbow triangles
- Gallai-Ramsey numbers for three graphs on at most five vertices
- Ramsey-type results for Gallai colorings
- Gallai-Ramsey numbers for rainbow \(S_3^+\) and monochromatic paths
- Gallai-Ramsey numbers for a class of graphs with five vertices
- Gallai-Ramsey number of an 8-cycle
- Rainbow generalizations of Ramsey theory: A survey
- Zero-sum problems -- a survey
- Gallai-Ramsey numbers for monochromatic triangles or 4-cycles
- Schur numbers involving rainbow colorings
- The Gallai-Ramsey number for a tree versus complete graphs
- Gallai-Ramsey numbers of odd cycles and complete bipartite graphs
- Gallai-Ramsey number for complete graphs
- Gallai-Ramsey numbers for multiple triangles
- On restricted colourings of \(K_ n\)
- A complete characterization of the zero-sum (mod 2) Ramsey numbers
- A note on the monotonicity of mixed Ramsey numbers
- Nonlinear large deviations: beyond the hypercube
- Weakened size Gallai-Ramsey numbers for K₅
- Gallai-Ramsey numbers for books
- A note on Gallai-Ramsey number of even wheels
- Disproofs of four conjectures on Gallai-Ramsey numbers
- Colored graphs without colorful cycles
- Improved upper bounds for Gallai-Ramsey numbers of paths and cycles
- Extensions of Gallai-Ramsey results
- Gallai-Ramsey numbers for graphs with five vertices and chromatic number four
- The star-critical Gallai-Ramsey number \(gr_\ast (F_{3,2}, K_3, K_3)\) and related critical colorings
- Multicolor Ramsey theory for a fan versus complete graphs
- A direct approach to the Gallai-Schur numbers
- Edge-colorings avoiding rainbow and monochromatic subgraphs
- Gallai-Ramsey numbers for paths
- Complete edge-colored permutation graphs
- On exact blockers and anti-blockers, \(\varDelta \)-conjecture, and related problems
- Gallai-Ramsey numbers of \(C_{10}\) and \(C_{12}\)
- Zero-sum subsequences in Abelian non-cyclic groups
- Gallai-Ramsey number of even cycles with chords
- Sandwich problem for \(\varPi\)- and \(\varDelta\)-free multigraphs and its applications to positional games
- scientific article; zbMATH DE number 1506501 (Why is no real title available?)
- Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
- Star-critical Gallai-Ramsey numbers involving the disjoint union of triangles
- Gallai–Ramsey number for K5 ${K}_{5}$
- Properly edge-coloured subgraphs in colourings of bounded degree
- Gallai-Ramsey number of odd cycles with chords
- All partitions have small parts -- Gallai-Ramsey numbers of bipartite graphs
- Ramsey theory for a generalized fan versus triangles
- Gallai-Ramsey numbers of books
- On zero sum Ramsey numbers: Multiple copies of a graph
- Extremal problems and results related to Gallai-colorings
- Constructive Methods in Gallai-Ramsey Theory for Hypergraphs
- Extremal problems in uniformly dense hypergraphs
This page was built for publication: Edge-colored complete graphs with precisely colored subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q787167)
