Coloring triangle‐free graphs with local list sizes

DOI10.1002/rsa.20945zbMath1464.05148DBLPjournals/rsa/DaviesVKP20arXiv1812.01534OpenAlexW2902485876WikidataQ100395734 ScholiaQ100395734MaRDI QIDQ5136931

Ewan Davies, François Pirot, Ross J. Kang, Rémi de Joannis de Verclos

Publication date: 30 November 2020

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

triangle-free graphslist coloringhard-core model

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items (12)

Asymmetric list sizes in bipartite graphs ⋮ Independent transversals in bipartite correspondence-covers ⋮ The $\chi$-Ramsey Problem for Triangle-Free Graphs ⋮ Bounding \(\chi\) by a fraction of \(\Delta\) for graphs without large cliques ⋮ Bipartite induced density in triangle-free graphs ⋮ Counting colorings of triangle-free graphs ⋮ Occupancy fraction, fractional colouring, and triangle fraction ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ Edge-colouring graphs with local list sizes ⋮ Unnamed Item ⋮ Separation Choosability and Dense Bipartite Induced Subgraphs ⋮ Fractional Chromatic Number, Maximum Degree, and Girth

This page was built for publication: Coloring triangle‐free graphs with local list sizes