Combinatorica 1992: Vol 12 Table of Contents

3 Pages·1992·0.97 MB·English

~ COMBINATORICA COMBINATORICA 12 (4) (1992) 497-498
Akadémiai Kiad6 — Springer-Verlag
CONTENTS OF VOLUME 12
NUMBER 1
R. AHLSWEDE, N. CAI, Z. ZHANG: Diametric theorems in sequence spaces.
V. CHVATAL, C. MCDIARMID: Small transversals in hypergraphs
W. Cook, M. HARTMANN, R. KANNAN, C. MCDIARMID: On integer points
in polyhedra
P. Erpos, R. L. GRAHAM, I. Z. Ruzsa, H. TAYLOR: Bounds for arrays of
dots with distinct slopes or lengths
A. K. KELMANS: Spanning trees of extended graphs
G. L. MILLER, V. RAMACHANDRAN: A new graph triconnectivity algorithm
and its parallelization
T. PISANSKI, T. W. TUCKER, D. WITTE: The non-orientable genus of some
metacyclic groups
A. Pott: New necessary conditions on the existence of abelian difference sets
R. SUNDAR: On the Deque conjecture for the splay algorithm
NUMBER 2
N. ALON, M. TARsI: Colorings and orientations of graphs
I. BARANY, R. Howe, L. LovAsz: On integer points in polyhedra: a lower
bound
. Broxuuis, A. SeREssS, H. A. WILBRINK: Characterization of complete
exterior sets of conics
. M. JAckKson, L. B. RICHMOND: The asymptotic behaviour of the number
of three-connected triangulations of the disk, with a reflective symme-
try in a line
J. KAHN, P. D. SEYMour: A fractional version of the Erdés—Faber—Lovasz
conjecture
. KANNAN: Lattice translates of a polytope and the Frobenius problem... .
. KORNER, G. Simonyl, Zs. TuzZA: Perfect couples of graphs
. McCAVANEY, J. ROBERTSON, W. WEBB: Ramsey partitions of integers
and fair divisions
. MCMULLEN, E. SCHULTE: Regular polytopes of type {4,4,3} and {4,4,4}
. PuDLAK, V. RODL: A combinatorial approach to complexity
T. SzOny1: Note on the existence of large minimal blocking sets in Galois
NOTES
T. Hist: Dual polytopes of rational convex polytopes...................0005 237
Gy. Y. KATONA: Searching for f-Hamiltonian circuits..................... 241
NUMBER 3
. M. ADIN: Counting colorful multi-dimensional trees
. ARONOV, H. EDELSBRUNNER, L. J. GuIBAS, M. SHARIR: The number
of edges of many faces in a line segment arrangement
. Cutu: Cubic Ramanujan graphs
. L. Erpés, P. FRANKL, D. J. KLEITMAN, M. E. Saks, L. A. SZEKELY:
Sharpening the LYM inequality
. HAJNAL, M. SZEGEDy: On packing bipartite graphs
. HOLZMAN, D. J. KLEITMAN: Sign vectors and unit vectors
. D. PORTER: On a bottleneck bipartition conjecture of Erdés
wVSDUs’. H TD. UR HEE, M. TALAGRAND: On the long edges in the shortest tour through
n random points
W. T. RHEE, M. TALAGRAND: Packing random items of three colors
A. SALI: Some intersection theorems
NOTES
A. T. LISAN: Multi-dimensional Ramsey theorems — an example
D. MIKLOs: Disproof of a conjecture in graph reconstruction theory
NUMBER 4
Tibor Gallai, 1912-1992
P. Erp6s: In memory of Tibor Gallai
N. ALon, C. MCDIARMID, B. REED: Star arboricity
V. G. BOLTJANSKI, P. S. SOLTAN: A solution of Hadwiger’s covering problem
for zonoids
Jin-Y1 CAl, M. FURER, N. IMMERMAN: An optimal lower bound on the
number of variables for graph identification
. HRUSHOVSKI: Extending partial isomorphisms of graphs
. KAHN: On a problem of Erdés and Lovasz: random lines in a projective
plane
S. L. MA: Reversible relative difference sets
E. W. Mayr, C. G. PLAXTON: On the spanning trees of weighted graphs .
N. NISAN: Pseudorandom generators for space-bounded computation
H. J. PROMEL, A. STEGER: The asymptotic number of graphs not containing
a fixed color-critical subgraph
T. STEHLING: On computing the number of subgroups of a finite Abelian
C . THOMASSEN: The Hadwiger number of infinite vertex-transitive graphs. .
NOTE
P. FRANKL: The convex hull of antichains in posets
Contents of Volume 12