On the maximal colorings of complete graphs without some small properly colored subgraphs
type: Item
instance of: scholarly article
title: On the maximal colorings of complete graphs without some small properly colored subgraphs
zbMATH Open document ID: 1479.05102
author: Chunqiu Fang
author: Ervin Győri
author: Ji Meng Xiao
published in: Graphs and Combinatorics
publication date: 2021-11-30T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05D10
Mathematics Subject Classification ID: 05C55
zbMATH DE Number: 7435723
zbMATH Keywords: properly colored subgraphs
zbMATH Keywords: Turán numbers
zbMATH Keywords: anti-Ramsey numbers
MaRDI profile type: Publication
full work available at URL: s00373-021-02351-4
OpenAlex ID: W3168543365
cites work: On a conjecture of erdöus, simonovits, and sós concerning anti‐Ramsey theorems
cites work: Q5463539
cites work: Anti-Ramsey numbers of small graphs.
cites work: On Graphs that do not Contain a Thomsen Graph
cites work: On maximal paths and circuits of graphs
cites work: Q5520566
cites work: Q5567712
cites work: Q4075490
cites work: On the structure of linear graphs
cites work: Rainbow generalizations of Ramsey theory: A survey
cites work: Edge-colorings with no large polychromatic stars
cites work: Edge-colorings of complete graphs that avoid polychromatic trees
cites work: Properly edge-colored theta graphs in edge-colored complete graphs
cites work: Minimal colorings for properly colored subgraphs
cites work: An anti-Ramsey theorem on diamonds
cites work: An anti-Ramsey theorem
cites work: An anti-Ramsey theorem on cycles
cites work: Rainbow numbers for matchings and complete graphs
cites work: On restricted colourings of \(K_ n\)
cites work: Properly colored \(C_4\)'s in edge-colored graphs
DOI: 10.1007/S00373-021-02351-4
description: scientific article; zbMATH DE number 7435723