Combinatorica, Volume 19
Volume 19, Number 1, 1999
György Elekes:
On Linear Combinatorics III. Few Directions and Distorted Lattices. 43-53 Kazuo Murota:
Submodular Flow Problem with a Nonseparable Cost Function. 87-109 János Pach,
Joel Spencer:
Uniformly Distributed Distances - a Geometric Application of Janson's Inequality. 111-124 Xuding Zhu:
Graphs Whose Circular Chromatic Number Equals the Chromatic Number. 139-149
Volume 19, Number 2, 1999
David A. Grable:
More-Than-Nearly-Perfect Packings and Partial Designs. 221-239
Note
Volume 19, Number 3, 1999
Volume 19, Number 4, 1999
Martin Grohe:
Equivalence in Finite-Variable Logics is Complete for Polynomial Time. 507-532 Dmitry N. Kozlov:
Maximizing the Möbius Function of a Poset and the Sum of the Betti Numbers of the Order Complex. 533-548 László Pyber:
A Bound for the Diameter of Distance-Regular Graphs. 549-553 Jirí Sgall:
Bounds on Pairs of Families with Restricted Intersections. 555-566 Van H. Vu:
Extremal Set Systems with Weakly Restricted Intersections. 567-587 Soojin Cho:
On the Support Size of Null Designs of Finite Ranked Posets. 589-595
maintained by
, founded at
Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar
Rudolf Ahlswede, Levon H. Khachatrian:
last updated on 2019-03-26 22:38 CET by the dblp team
data released under the ODC-BY 1.0 license
