Result 1 to 20 of 960 total
On the chromatic numbers of spheres in $R^n$. (English)
Combinatorica 32, No. 1, 111-123 (2012).
1
Monotonicity testing and shortest-path routing on the cube. (English)
Combinatorica 32, No. 1, 35-53 (2012).
2
The geometry of manipulation ‒ a quantitative proof of the Gibbard-Satterthwaite theorem. (English)
Combinatorica 32, No. 2, 221-250 (2012).
3
A counterexample to the Alon-Saks-Seymour conjecture and related problems. (English)
Combinatorica 32, No. 2, 205-219 (2012).
4
3-uniform hypergraphs avoiding a given odd cycle. (English)
Combinatorica 32, No. 2, 187-203 (2012).
5
On the Ramsey multiplicity of complete graphs. (English)
Combinatorica 32, No. 2, 171-186 (2012).
6
Almost all triangle-free triple systems are tripartite. (English)
Combinatorica 32, No. 2, 143-169 (2012).
7
A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks. (English)
Combinatorica 32, No. 1, 1-33 (2012).
8
Proof of a conjecture of V. Nikiforov. (English)
Combinatorica 31, No. 6, 739-754 (2011).
9
A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity. (English)
Combinatorica 31, No. 6, 703-723 (2011).
10
On the problem of finding disjoint cycles and dicycles in a digraph. (English)
Combinatorica 31, No. 6, 639-668 (2011).
11
The unbounded-error communication complexity of symmetric functions. (English)
Combinatorica 31, No. 5, 583-614 (2011).
12
On the threshold for $k$-regular subgraphs of random graphs. (English)
Combinatorica 31, No. 5, 565-581 (2011).
13
Poset limits and exchangeable random posets. (English)
Combinatorica 31, No. 5, 529-563 (2011).
14
On the non-existence of pair covering designs with at least as many points as blocks. (English)
Combinatorica 31, No. 5, 507-528 (2011).
15
Distinguishing labeling of the actions of almost simple groups. (English)
Combinatorica 31, No. 4, 489-506 (2011).
16
On the chromatic number of random geometric graphs. (English)
Combinatorica 31, No. 4, 423-488 (2011).
17
Packing directed circuits exactly. (English)
Combinatorica 31, No. 4, 397-421 (2011).
18
On planarity of compact, locally connected, metric spaces. (English)
Combinatorica 31, No. 3, 365-376 (2011).
19
Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in. (English)
Combinatorica 31, No. 3, 33-364 (2011).
20
Result 1 to 20 of 960 total
Start
Contact
Print
General Help
