110
click to vote
JCT
2007
15 years 17 days ago
2007
Let P(G,t) and F(G,t) denote the chromatic and flow polynomials of a graph G. D.R. Woodall has shown that, if G is a plane triangulation, then the only zeros of P(G,t) in (−∞...
JCT
2007
15 years 17 days ago
2007
We prove results on the size of weakly and strongly separating set systems and matrices, and on cross-intersecting systems. As a consequence, we improve on a result of Katona and ...
92
Voted
JCT
2007
15 years 17 days ago
2007
The preferential attachment graph Gm(n) is a random graph formed by adding a new vertex at each time step, with m edges which point to vertices selected at random with probability...
65
Voted
JCT
2007
15 years 17 days ago
2007
90
Voted
JCT
2007
15 years 17 days ago
2007
We prove that one can express the vertex-minor relation on finite undirected graphs by formulas of monadic second-order logic (with no edge set quantification) extended with a p...
59
Voted
JCT
2007
15 years 17 days ago
2007
55
Voted
JCT
2007
15 years 17 days ago
2007
93
Voted
JCT
2007
15 years 17 days ago
2007
We show that for each ε > 0 and each integer ∆ ≥ 1, there exists a number g such that for any graph G of maximum degree ∆ and girth at least g, the circular chromatic in...
60
Voted
JCT
2007
15 years 17 days ago
2007