Sciweavers

76 search results - page 8 / 16
» jct 2008
Sort
View
JCT
2008
54views more  JCT 2008»
14 years 9 months ago
Nowhere-zero 3-flows in triangularly connected graphs
Genghua Fan, Hong-Jian Lai, Rui Xu, Cun-Quan Zhang...
JCT
2008
92views more  JCT 2008»
14 years 9 months ago
3-Uniform hypergraphs of bounded degree have linear Ramsey numbers
Chv
Oliver Cooley, Nikolaos Fountoulakis, Daniela K&uu...
JCT
2008
91views more  JCT 2008»
14 years 8 months ago
A chain theorem for matroids
Tutte's Wheels-and-Whirls Theorem proves that if M is a 3-connected matroid other than a wheel or a whirl, then M has a
James G. Oxley, Charles Semple, Geoff Whittle
JCT
2008
101views more  JCT 2008»
14 years 9 months ago
Refined activation strategy for the marking game
This paper introduces a new strategy for playing the marking game on graphs. Using this strategy, we prove that if G is a planar graph, then the game colouring number of G, and he...
Xuding Zhu
JCT
2008
70views more  JCT 2008»
14 years 9 months ago
The number of possibilities for random dating
Let G be a regular graph and H a subgraph on the same vertex set. We give surprisingly compact formulas for the number of copies of H one expects to find in a random subgraph of G...
Aaron Abrams, Rod Canfield, Andrew Granville