On the maximal colorings of complete graphs without some small properly colored subgraphs
From MaRDI portal
Publication:2053693
DOI10.1007/S00373-021-02351-4zbMath1479.05102OpenAlexW3168543365MaRDI QIDQ2053693
Chunqiu Fang, Ervin Gyoeri, Ji Meng Xiao
Publication date: 30 November 2021
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-021-02351-4
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rainbow generalizations of Ramsey theory: A survey
- An anti-Ramsey theorem on diamonds
- On restricted colourings of \(K_ n\)
- Edge-colorings of complete graphs that avoid polychromatic trees
- Edge-colorings with no large polychromatic stars
- Properly edge-colored theta graphs in edge-colored complete graphs
- Rainbow numbers for matchings and complete graphs
- Properly colored \(C_4\)'s in edge-colored graphs
- Minimal colorings for properly colored subgraphs
- An anti-Ramsey theorem on cycles
- Anti-Ramsey numbers of small graphs
- On maximal paths and circuits of graphs
- On a conjecture of erdöus, simonovits, and sós concerning anti‐Ramsey theorems
- On Graphs that do not Contain a Thomsen Graph
- On the structure of linear graphs
- An anti-Ramsey theorem
This page was built for publication: On the maximal colorings of complete graphs without some small properly colored subgraphs
