VOLUME

Preface                                

Scientific program                        
	List of participants
C.G. D’AMBLY:	Whitney’ schen Abhängigkeitsstrukturen	25

M.AIGNER and
TH. A.DOWLING:	An extension of the König-Egerväry theorem	39
J.C.ARDITTI and
R.CORI:	Hamilton circuits in the comparability graph of a
	tree	41
L. BABAI:	Representation of permutation groups by graphs . .
G.BARON:	Uber verallgemeinerungen des Langford’ schen
	Problems	81
G.BAROTI:	Calcul des nombres de birecouvrements et de
	birevêtements d’ un ensemble fini, employant la
	mêthode fonctionnelle	93
E.G.BELTRAMETTI:	Lorentz transformations and symmetry properties
	in Galois space-time	105

G. BERGE:	Sur certains hypergraphes généralisant les graphes bipartites

W.G.BROWN and
F. HARARY:	Extremal digraphs	135
S.A. BURR and
R. L. GRAHAM:	On a class of equivalent linear and nonlinear integer programming problems

Y.CESARI:	Optimisation des questionnaires avec contrainte de rang                                   

D.CHENAIS et
M. TERRE NOIRE:	Determination de la realisation d’ un processus aléatoire a 1’ aide de pseudoquestionnaires
H. H.CRAPO:		Chromatic polynomials for a join of graphs      
J.CSIMA:		Stochastic functions on hypergraphs
J.DENES and	E.TOROK:	Groups and graphs
H.DINGES:		Combinatorial properties of partial sums with
	measure-theoretic applications
W.DORFLER und
W.IMRICH:	Uber die X-summe von Mengensystemen
P. ERDOS:		On a lemma of Hajnal-Folkman

P. ERDOS, L. GERENCSER
and A. MATE:	Problems of graph theory concerning optimal design

P. ERDOS, A. HAJNAL
and E.C. MILNER:	Set mappings and polarized partition relations . .
	‘

P. ERDOS and J.KOMLOS:	On a problem of Moser

P. ERDOS and
J. SCHONHEIM:	On the set ot non pairwise coprime divisors of a number

P. ERDOS and
M. SIMONOVITS:	Some extremal problems in graph theory

VOLUME II.

P. ERDOS and
VERA T. SOS:	Some remarks on Ramsey’ s and Turän’ s theorem.

P. ERDOS and
E.G. STRAUS:	Nonaveraging sets II

D.FOATA and
M. P. SCHUTZENBERGER:	On the rook polynomials of Ferrers relations . . . .
J. H. FOLKMAN:	An upper bound on the chromatic number of a graph 437

Z. FONYAD, Gy. GYIMESI
and M. HOSSZU:	The allocation of power resources on networks . .
E. FRIED:	On homogeneous tournaments	467

J.GOLDMAN and
G. -C . ROTA:	On the foundations of combinatorial theory IV
	Finite vector spaces and Eulerian generating
	functions
M.GORDON:	Combinatorics and graph theory of abundance and
	stability of chemical species
F.GOBEL:	On a close relation between Sperner collections
	and certain chance games	525

R.L.GRAHAM and
B. L. ROTSCHILD:	Ramsey’s theorem for N-parameter sets: an outline 531
R.K.GUY:	Sequences associated with a problem of Turan and
	other problems	553

A.GYARFAS and
J. LEHEL:	A Helly-type problem in trees	571

th
A. HADIAN and M. SOBEL: Selecting the t largest using binary errorless
	comparisons	585

A. HAJNAL and
E.SZEMEREDI:	Proof of a conjecture of P. Erdos	601
F.HARARY:	Problems involving graphical numbers	625

B. HARRIS and
L. SCHOENFLED:	A composition theorem for the enumeration of certain subsets of symmetric semigroups and the
corresponding sets of labeled functional digraphs. .

W. IMRICH:	Graphs with transitive Abelian automorphism group 651
A.JACQUES:	Constellations et graphes topologiques	657

H.A.JUNG:	On subgraphs without cycles in a tournament . . . . 675 H.J. L. KAMPS and
J.H. van LINT:	A covering problem	679
G.O. H. KATONA:	How many sums of vectors can lie in a circle of
	radius V2?...	687
G.O. H. KATONA and
D.O. H. SZASZ:	Matching problems
D. A. KLARNER:	Methods for the general cell growth problem	7
J. KOMLOS and M.SULYOK:	On the sum of elements of + 1 matrices	7
W. KUICH:	Enumeration problems and context-free languages. .	7

R. LANG:	Ein Kantennummerierungsproblem bei kubischen Graphen

D. H. LEHM	Permutation with strongly restricted displacements . 7
YU. V. LINNIK:	Some combinatorial problems of multinomial
	sequential estimation	7
L. LOVASZ:	Generalized factors of graphs	7
N. S. MENDELSOHN:	Directed graphs with the unique path property	7

VOLUME III.
V.V. MENON:	Some partitions of, and the number of Borel fields
	on, large finite sets	8

C. St.J. A. NASH-
WILLIAMS:	Hamiltonian lines in graphs whose vertices have

sufficiently large valencies                   
J. NOVAK:	Uber gewisse Tripel-systeme	8

l. PALASTI:	On the common edges of Hamilton-cycles of a
	complete linear graph	8
J. PELIKAN:	Properties of balanced incomplete block designs . . . M. PETER SDORF and
H. SAC HS:	Spektrum und Automorphismengruppe eines Graphen	8
G. F. PICARD:	Combinatorial problems concerning rooted-trees. . 	9
N.J. PULLMAN:	Products of Boolean matrices
R. RADO:	Some partition theorems	9
H. RETKIN:	A cubic configuration in the plane of order 7	9
C . R ENYI and A. R ENYI:	The Piüfer code for k-trees
C.A.ROGERS:	Holmes’ graphical approach to the theory of
	complete metric spaces	9

- 1200 -
K. SARKADI:	Combinatorial proof for a theorem of H. E.Daniels
N. SAUER:	On the factorization of n-graphs	981
S. SCHWAR Z:	On powers of binary relations on a finite set
M.SIMONOVITS:	Extremal graph problems with conditions	999

R.G. STANTON and
J.D.HORTON:	Composition of room squares	1013
R.G.STANTON and
D. P.ROSELLE:	A result on Davenport-Schinzel sequences	1023
L. SURANYI:	On a problem of P.Erdos and A. Hajnal	1029
A.A. SYKOW:	Algebraische Näherungen zur Hadwiger-Vermutung .
E.SZEMERI:	On a problem of P. Erdos	1051
P. TUR AN:	On some connections between combinatorics and
	group theory	1055

H.J.VOSS:	Eigenschaften von Graphen, die eine bestimmte
Anzahl kantenfremder Kreise enthalten und in denen
der Grad der Knotenpunkte nach unten bescheankt ist
B. L. van der WAERDEN:	On a theorem of Volker Strassen	1103
K. WAGNER:	On the minimal graphs being not embeddable into the
	projective plane

H. WALTHER:	Uber grösste Kleinkreise und kleinste Grosskreise .

W. WESSEL:	On the problem of determining whether a given graph is edge-critical or not
R.J.WILSON:	The Selberg sieve for a lattice
	Problems	1151