On Vizing's problem for triangle-free graphs

DOI10.37236/12703MaRDI QIDQ6901260zbMATH OpenFDO

Authors Ross J. Kang, Matthieu Rosenfeld

Publication date 12 November 2025

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

Full work available at URL https://doi.org/10.37236/12703

zbMATH Keywords

chromatic numberclique

Mathematics Subject Classification ID

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

Cites work

• A bound on the chromatic number of a graph
• A constructive proof of the general Lovász local lemma
• A constructive proof of the Lovász local lemma
• A dense infinite Sidon sequence
• A general framework for hypergraph coloring
• A note on Ramsey numbers
• A note on the independence number of triangle-free graphs
• An improved procedure for colouring graphs of bounded local density
• Another approach to non-repetitive colorings of graphs of bounded degree
• Another bound on the chromatic number of a graph
• Asymmetric list sizes in bipartite graphs
• Coloring graphs with sparse neighborhoods
• Coloring triangle-free graphs with local list sizes
• Colorings and orientations of graphs
• Counting colorings of triangle-free graphs
• Covering the vertex set of a graph with subgraphs of smaller degree
• Destroying noncomplete regular components in graph partitions
• Graph colouring and the probabilistic method
• Graph Theory and Probability
• scientific article; zbMATH DE number 3492718 (Why is no real title available?)
• scientific article; zbMATH DE number 1286500 (Why is no real title available?)
• scientific article; zbMATH DE number 821271 (Why is no real title available?)
• scientific article; zbMATH DE number 3284071 (Why is no real title available?)
• scientific article; zbMATH DE number 3043302 (Why is no real title available?)
• scientific article; zbMATH DE number 3050594 (Why is no real title available?)
• On an upper bound of the graph's chromatic number, depending on the graph's degree and density
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• Sur le coloriage des graphs
• The choice number of random bipartite graphs
• The Johansson-Molloy theorem for DP-coloring
• The list chromatic number of graphs with small clique number
• The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma
• The smallest triangle-free 4-chromatic 4-regular graph
• Uniformly Random Colourings of Sparse Graphs

This page was built for publication: On Vizing's problem for triangle-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6901260)