Lower bound on the maximum denominator of fractional chromatic numbers

DOI10.37236/14524MaRDI QIDQ7254902zbMATH OpenFDO

Authors Marthe Bonamy, Karolína Hylasová, Tomáš Kaiser, Jean-Sébastien Sereni

Publication date 29 May 2026

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

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

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Fractional graph theory, fuzzy graph theory (05C72)

Cites work

• Approximation algorithms for NP-hard problems.
• Choosability and fractional chromatic numbers
• Fractional colorings with large denominators
• Generalized Fibonacci Numbers and Associated Matrices
• scientific article; zbMATH DE number 1175369 (Why is no real title available?)
• scientific article; zbMATH DE number 6116733 (Why is no real title available?)
• On Generalized Fibonacci Numbers
• The fractional chromatic number of mycielski's graphs
• Two Results Concerning Multicoloring

This page was built for publication: Lower bound on the maximum denominator of fractional chromatic numbers

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