On the maximal colorings of complete graphs without some small properly colored subgraphs

DOI10.1007/S00373-021-02351-4MaRDI QIDQ2053693zbMATH OpenOpenAlexFDO

Authors Chunqiu Fang, Ervin Győri, Ji Meng Xiao

Publication date 30 November 2021

Published in Graphs and Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s00373-021-02351-4

zbMATH Keywords

anti-Ramsey numbersproperly colored subgraphsTurán numbers

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Recommendations

• Maximal edge-colorings of graphs
• Structure of colored complete graphs free of proper cycles
• Rainbow Turán Problems
• On colorings avoiding a rainbow cycle and a fixed monochromatic subgraph
• Edge colorings of graphs avoiding some fixed monochromatic subgraph with linear Turán number

Cites work

• An anti-Ramsey theorem
• An anti-Ramsey theorem on cycles
• An anti-Ramsey theorem on diamonds
• Anti-Ramsey numbers of small graphs.
• Edge-colorings of complete graphs that avoid polychromatic trees
• Edge-colorings with no large polychromatic stars
• scientific article; zbMATH DE number 3494450 (Why is no real title available?)
• scientific article; zbMATH DE number 2192164 (Why is no real title available?)
• scientific article; zbMATH DE number 3232670 (Why is no real title available?)
• scientific article; zbMATH DE number 3285073 (Why is no real title available?)
• Minimal colorings for properly colored subgraphs
• On a conjecture of erdöus, simonovits, and sós concerning anti‐Ramsey theorems
• On Graphs that do not Contain a Thomsen Graph
• On maximal paths and circuits of graphs
• On restricted colourings of \(K_ n\)
• On the structure of linear graphs
• Properly colored \(C_4\)'s in edge-colored graphs
• Properly edge-colored theta graphs in edge-colored complete graphs
• Rainbow generalizations of Ramsey theory: A survey
• Rainbow numbers for matchings and complete graphs

Cited in

(5)

• Maximal edge-colorings of graphs
• Anti-Ramsey numbers of subdivided graphs
• Maximal edge colorings of graphs
• Maximal edge-colorings of graphs
• Properly colored cycles in edge-colored complete graphs

This page was built for publication: On the maximal colorings of complete graphs without some small properly colored subgraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2053693)