Separation choosability and dense bipartite induced subgraphs

02/11/2018
by   Louis Esperet, et al.
0

We study a restricted form of list colouring, for which every pair of lists that correspond to adjacent vertices may not share more than one colour. The optimal list size such that a proper list colouring is always possible given this restriction, we call separation choosability. We show for bipartite graphs that separation choosability increases with (the logarithm of) the minimum degree. This strengthens results of Molloy and Thron and, partially, of Alon. One attempt to drop the bipartiteness assumption precipitates a natural class of Ramsey-type questions, of independent interest. For example, does every triangle-free graph of minimum degree d contain a bipartite induced subgraph of minimum degree Ω( d) as d→∞?

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/07/2018

Bipartite induced density in triangle-free graphs

Any triangle-free graph on n vertices with minimum degree at least d con...
research
11/09/2022

Graph classes equivalent to 12-representable graphs

Jones et al. (2015) introduced the notion of u-representable graphs, whe...
research
06/04/2020

List-three-coloring P_t-free graphs with no induced 1-subdivision of K_1,s

Let s and t be positive integers. We use P_t to denote the path with t v...
research
06/22/2015

Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs

We consider a natural restriction of the List Colouring problem: k-Regul...
research
12/12/2022

Optimal thresholds for Latin squares, Steiner Triple Systems, and edge colorings

We show that the threshold for the binomial random 3-partite, 3-uniform ...
research
12/04/2018

Colouring triangle-free graphs with local list sizes

We prove two distinct and natural refinements of a recent breakthrough r...
research
04/16/2021

On the power of random greedy algorithms

In this paper we solve two problems of Esperet, Kang and Thomasse as wel...

Please sign up or login with your details

Forgot password? Click here to reset