AbstractLet G be a triangle-free graph with maximum degree at most 3. Staton proved that the independence number of G is at least 514|V(G)|. Heckman and Thomas conjectured that Staton’s result can be strengthened into a bound on the fractional chromatic number of G, namely χf(G)≤145. Recently, Hatami and Zhu proved that χf(G)≤3−364. In this paper, we prove χf(G)≤3−343
AbstractIt is shown that the difference between the chromatic number χ and the fractional chromatic ...
For graphs G and H let G[H] be their lexicographic product and let χf (G) = inf{χ(G[Kn])/n | n = 1, ...
Zykov designed one of the oldest known families of triangle-free graphs with arbitrarily high chroma...
AbstractLet G be a triangle-free graph with maximum degree at most 3. Staton proved that the indepen...
Heckman and Thomas conjectured that the fractional chromatic number of any triangle-free subcubic gr...
International audienceWe introduce a new method for computing bounds on the independence number and ...
King, Lu, and Peng recently proved that for ∆ ≥ 4, any K∆-free graph with maxi-mum degree ∆ has fra...
AbstractIn a triangle-free graph, the neighbourhood of every vertex is an independent set. We invest...
This dissertation mainly comes from my recent study of fractional chromatic numbers of graphs, spect...
We prove that every subcubic triangle-free graph has fractional chromatic number at most 14/5, thus ...
Reed conjectured that for every ϵ>0 and Δ there exists g such that the fractional total chromatic nu...
AbstractReed conjectured that for every ϵ>0 and Δ there exists g such that the fractional total chro...
It is shown that the difference between the chromatic number χ and the fractional chromatic number χ...
AbstractTriangle-free graphs of order n with minimum degree exceeding n/3 satisfy strong structural ...
Reed conjectured that for every > 0 and ∆ there exists g such that the fractional total chromatic...
AbstractIt is shown that the difference between the chromatic number χ and the fractional chromatic ...
For graphs G and H let G[H] be their lexicographic product and let χf (G) = inf{χ(G[Kn])/n | n = 1, ...
Zykov designed one of the oldest known families of triangle-free graphs with arbitrarily high chroma...
AbstractLet G be a triangle-free graph with maximum degree at most 3. Staton proved that the indepen...
Heckman and Thomas conjectured that the fractional chromatic number of any triangle-free subcubic gr...
International audienceWe introduce a new method for computing bounds on the independence number and ...
King, Lu, and Peng recently proved that for ∆ ≥ 4, any K∆-free graph with maxi-mum degree ∆ has fra...
AbstractIn a triangle-free graph, the neighbourhood of every vertex is an independent set. We invest...
This dissertation mainly comes from my recent study of fractional chromatic numbers of graphs, spect...
We prove that every subcubic triangle-free graph has fractional chromatic number at most 14/5, thus ...
Reed conjectured that for every ϵ>0 and Δ there exists g such that the fractional total chromatic nu...
AbstractReed conjectured that for every ϵ>0 and Δ there exists g such that the fractional total chro...
It is shown that the difference between the chromatic number χ and the fractional chromatic number χ...
AbstractTriangle-free graphs of order n with minimum degree exceeding n/3 satisfy strong structural ...
Reed conjectured that for every > 0 and ∆ there exists g such that the fractional total chromatic...
AbstractIt is shown that the difference between the chromatic number χ and the fractional chromatic ...
For graphs G and H let G[H] be their lexicographic product and let χf (G) = inf{χ(G[Kn])/n | n = 1, ...
Zykov designed one of the oldest known families of triangle-free graphs with arbitrarily high chroma...
DOI
Add to ORKG