10 search results - page 1 / 2 » Last cases of Dejean's conjecture |
68
Voted
TCS
2011
14 years 7 months ago
2011
99
Voted
SIAMDM
2010
14 years 10 months ago
2010
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...
128
Voted
ITA
2008
15 years 12 days ago
2008
We prove two cases of a strong version of Dejean's conjecture involving extremal letter frequencies. The results are that there exist an infinite " 5 4 + " -free wor...
CPC
2007
15 years 12 days ago
2007
In 1972, M. Rosenfeld asked if every triangle-free graph could be embedded in the unit sphere Sd in such a way that two vertices joined by an edge have distance more than √ 3 (i...
86
Voted
JAL
2006
15 years 12 days ago
2006
Egecioglu and Remmel [2] gave an interpretation for the entries of the inverse Kostka matrix K-1 in terms of special rim-hook tableaux. They were able to use this interpretation to...