Turán numbers and anti-Ramsey numbers for short cycles in complete \(3\)-partite graphs

DOI10.37236/10628zbMath1516.05099arXiv2011.13715OpenAlexW4379185428MaRDI QIDQ6162143

Ervin Gyoeri, Chuanqi Xiao, Ji Meng Xiao, Chunqiu Fang

Publication date: 15 June 2023

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2011.13715

zbMATH Keywords

Turán numbersanti-Ramsey numbermultipartite cycles

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

The anti-Ramsey numbers of \(C_3\) and \(C_4\) in complete \(r\)-partite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On complete subgraphs of \(r\)-chromatic graphs
• Turán numbers of vertex-disjoint cliques in \(r\)-partite graphs
• The anti-Ramsey numbers of \(C_3\) and \(C_4\) in complete \(r\)-partite graphs
• Density of balanced 3-partite graphs without 3-cycles or 4-cycles
• Weighted Turán problems with applications
• On a conjecture of erdöus, simonovits, and sós concerning anti‐Ramsey theorems

This page was built for publication: Turán numbers and anti-Ramsey numbers for short cycles in complete \(3\)-partite graphs