betaFeedback

WorksMathematics

Bounds on the maximum denominator of fractional chromatic numbers

Abstract

For a positive rational number x=p/qx=p/q, where pp and qq are coprime positive integers, let den⁡(x)=q\operatorname{den}(x)=q. For a positive integer nn, let sd⁡(n)=max⁡{den⁡(χf(G)):∣V(G)∣=n}\operatorname{sd}(n)=\max\{\operatorname{den}(χ_f(G)): |V(G)|=n\}. Let D(n)=2−n(n+1)(n+1)/2D(n)=2^{-n}(n+1)^{(n+1)/2}. It was proved by Alon, Tuza and Voigt that sd⁡(n)≤D(n)\operatorname{sd}(n)\le D(n). In this paper, we prove that sd⁡(n)≤D(n)n−12log⁡2n+14log⁡2log⁡2n+O(1)\operatorname{sd}(n)\le D(n)n^{-\frac12\log_2 n+\frac14\log_2\log_2 n+O(1)} for all sufficiently large nn. For the lower bound on sd⁡(n)\operatorname{sd}(n), it was recently proved by Bonamy, Hylasová, Kaiser and Sereni that lim sup⁡n→∞sd⁡(n)1/n≥2\limsup_{n\to\infty}\operatorname{sd}(n)^{1/n}\ge\sqrt{2}. We prove that lim sup⁡n→∞sd⁡(n)1/n≥31/3>2\limsup_{n\to\infty}\operatorname{sd}(n)^{1/n}\ge 3^{1/3}>\sqrt{2}.

Paper details

vlnc:W_z2uj36n5
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 11

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…