On Two Problems in Ramsey--Turán Theory

DOI10.1137/16M1086078zbMath1369.05141arXiv1607.06393OpenAlexW2963575629MaRDI QIDQ5351866

Hong Liu, József Balogh, Maryam Sharifzadeh

Publication date: 31 August 2017

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

edge-coloringRamsey-Turánmonochromatic cliques

Mathematics Subject Classification ID

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

Related Items (1)

Two Conjectures in Ramsey--Turán Theory

Cites Work

• More results on Ramsey-Turán type problems
• Pentagons vs. triangles
• On a Ramsey-Turán type problem
• On the Ramsey-Turán numbers of graphs and hypergraphs
• Phase transitions in Ramsey-Turán theory
• The maximum number of K ₃ -free and K ₄ -free edge 4-colorings
• Triangle factors of graphs without large independent sets and of weighted graphs
• Some exact Ramsey-Turán numbers
• Graph Theory and Probability
• THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
• The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques
• Ramsey-Turán theory
• Many \(T\) copies in \(H\)-free graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On Two Problems in Ramsey--Turán Theory