Bipartite induced density in triangle-free graphs

DOI10.37236/8650zbMath1441.05119arXiv1808.02512OpenAlexW3029889037MaRDI QIDQ2185224

François Pirot, Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang

Publication date: 4 June 2020

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

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

zbMATH Keywords

fractional chromatic numberlist chromatic number

Mathematics Subject Classification ID

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

Related Items (6)

On the power of random greedy algorithms ⋮ The $\chi$-Ramsey Problem for Triangle-Free Graphs ⋮ Occupancy fraction, fractional colouring, and triangle fraction ⋮ Packing list‐colorings ⋮ Dense induced bipartite subgraphs in triangle-free graphs ⋮ Separation Choosability and Dense Bipartite Induced Subgraphs

Cites Work

• Unnamed Item
• Unnamed Item
• A note on the independence number of triangle-free graphs
• Chromatic number of finite and infinite graphs and hypergraphs
• A dense infinite Sidon sequence
• Asymptotic lower bounds for Ramsey functions
• Coloring triangle-free graphs with fixed size
• The list chromatic number of graphs with small clique number
• Triangle-free graphs with large chromatic numbers
• Dense induced bipartite subgraphs in triangle-free graphs
• On a valence problem in extremal graph theory
• Graph Theory and Probability. II
• Choice Numbers of Graphs: a Probabilistic Approach
• Bipartite Subgraphs of Triangle-Free Graphs
• The Ramsey number R(3, t) has order of magnitude t²/log t
• The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘)
• Coloring triangle‐free graphs with local list sizes
• Separation Choosability and Dense Bipartite Induced Subgraphs
• Dynamic concentration of the triangle-free process

This page was built for publication: Bipartite induced density in triangle-free graphs