Sciweavers

79 search results - page 1 / 16
» The Last Fraction of a Fractional Conjecture
Sort
View
SIAMDM
2010
138views more  SIAMDM 2010»
13 years 2 months ago
The Last Fraction of a Fractional Conjecture
Reed conjectured that for every ε > 0 and every integer ∆, there exists g such that the fractional total chromatic number of every graph with maximum degree ∆ and girth at...
Frantisek Kardos, Daniel Král', Jean-S&eacu...
CORR
2010
Springer
174views Education» more  CORR 2010»
13 years 4 months ago
Fractional generalizations of Young and Brunn-Minkowski inequalities
A generalization of Young's inequality for convolution with sharp constant is conjectured for scenarios where more than two functions are being convolved, and it is proven for...
Sergey Bobkov, Mokshay M. Madiman, Liyao Wang
EJC
2008
13 years 4 months ago
Fractional coloring and the odd Hadwiger's conjecture
Gerards and Seymour (see [T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley-Interscience, 1995], page 115) conjectured that if a graph has no odd complete minor of order p, the...
Ken-ichi Kawarabayashi, Bruce A. Reed
JGT
2010
103views more  JGT 2010»
13 years 2 months ago
Proof of a conjecture on fractional Ramsey numbers
: Jacobson, Levin, and Scheinerman introduced the fractional Ramsey function rf (a1,a2, ...,ak) as an extension of the classical definition for Ramsey numbers. They determined an e...
Jason Brown, Richard Hoshino
CORR
2010
Springer
78views Education» more  CORR 2010»
13 years 4 months ago
Flow-Cut Gaps for Integer and Fractional Multiflows
Consider a routing problem instance consisting of a demand graph H = (V, E(H)) and a supply graph G = (V, E(G)). If the pair obeys the cut condition, then the flow-cut gap for thi...
Chandra Chekuri, F. Bruce Shepherd, Christophe Wei...