35 citations · 160 across the 27 of their papers we have counts for
4 papers · 1 filter
A note on acyclic vertex-colorings
Jean-Sébastien Sereni, Jan Volec
We prove that the acyclic chromatic number of a graph with maximum degree is less than . This improves the previous upper bound, which was . To do so…
Compactness and finite forcibility of graphons
Roman Glebov, Daniel Kral, Jan Volec
Graphons are analytic objects associated with convergent sequences of graphs. Problems from extremal combinatorics and theoretical computer science led to a study of graphons deter…
A problem of Erdos and Sos on 3-graphs
Roman Glebov, Daniel Kral, Jan Volec
We show that for every positive epsilon there exist positive delta and n_0 such that every 3-uniform hypergraph on n>=n_0 vertices with the property that every k-vertex subset, whe…
Subcubic triangle-free graphs have fractional chromatic number at most 14/5
Zdeněk Dvořák, Jean-Sébastien Sereni, Jan Volec
We prove that every subcubic triangle-free graph has fractional chromatic number at most 14/5, thus confirming a conjecture of Heckman and Thomas [A new proof of the independence r…