72 search results - page 6 / 15 » combinatorics 1999 |
59
Voted
DM
1999
15 years 7 days ago
1999
COMBINATORICS
1999
15 years 7 days ago
1999
We give an integral identity which was conjectured and proved by using the continuous version of the multi-WZ method. Submitted: May 25, 1999; Accepted: October 20, 1999. Mathemat...
97
Voted
COMBINATORICS
1999
15 years 7 days ago
1999
We compute the number of rhombus tilings of a hexagon with sides n, n, N, n, n, N, where two triangles on the symmetry axis touching in one vertex are removed. The case of the comm...
101
click to vote
COMBINATORICS
1999
15 years 7 days ago
1999
We prove that the threshold for a random graph to have a k-core is equal to the threshold for having a subgraph which meets a necessary condition of Gallai for being k-critical. 1...
124
Voted
COMBINATORICS
1999
15 years 7 days ago
1999
Let k denote the maximum degree of the kth iterated line graph Lk(G). For any connected graph G that is not a path, the inequality k+1 2k - 2 holds. Niepel, Knor, and Solt