Result 1 to 15 of 15 total
How to color shift hypergraphs. (English)
Stud. Sci. Math. Hung. 30, No. 1-2, 1-11 (1995).
1
Operads, algebras, modules and motives. (English)
Astérisque. 233. Paris: Société Mathématique de France, 145 p. (1995).
2
All trapezoids are Ramsey. (English)
Discrete Math. 108, No.1-3, 59-62 (1992).
3
Equivariant cohomology and lower bounds for chromatic numbers. (English)
Trans. Am. Math. Soc. 333, No.2, 567-577 (1992); correction ibid. 352, No.4, 1951-1952 (2000).
4
The Menger-like property of the three-width of infinite graphs. (English)
J. Comb. Theory, Ser. B 52, No.1, 85-91 (1991).
5
Chromatic number of Hasse diagrams, eyebrows and dimension. (English)
Order 8, No.1, 41-48 (1991).
6
The Menger-like property of the tree-width of infinite graphs (English)
J. Comb. Theory, Ser. B 52, No. 1, 86-91 (1991).
7
Clique-sums, tree-decompositions and compactness. (English)
Discrete Math. 81, No.2, 177-185 (1990).
8
Proving a witness lemma in better-quasiordering theory: The method of “extensions”. (English)
Math. Proc. Camb. Philos. Soc. 106, No.2, 253-262 (1989).
9
A hypergraph-free construction of highly chromatic graphs without short cycles. (English)
Combinatorica 9, No.2, 227-229 (1989).
10
Well-quasiordering finite trees with gap-condition. Proof of Harvey Friedman’s conjecture. (English)
Ann. Math. (2) 130, No.1, 215-226 (1989).
11
A cycle-space invariant of the $<2$-distance-graph in the plane. (English)
Combinatorica 9, No.1, 103-105 (1989).
12
On restricted two-factors. (English)
SIAM J. Discrete Math. 1, No.4, 472-484 (1988).
13
Large independent sets in shift-invariant graphs. (English)
Graphs Comb. 3, 145-158 (1987).
14
A class of dimension-skipping graphs. (English)
Combinatorica 4, 317-319 (1984).
15
Result 1 to 15 of 15 total
Start
Contact
Print
General Help
