Combinatorics: proceedings of the Seventh Hungarian Colloquium on Combinatorics from July 5 to July 10, 1987 in Eger

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Author(s): A. Hajnal, L. Lovász, V. T. Sós (eds.)
Series: Colloquia Mathematica Societatis János Bolyai #52
Publisher: North-Holland
Year: 1987

Language: English

Title
Contents
Preface
R. AHLSWEDE: On code pairs with specified Hamming distances
S. ARNBORG, A. PROSKUROWSI, D. G. CORNEIL: Minimal forbidden minor characterization of a class of graphs
J. BECK: On irregularities of point sets in the unit square
M. BEN OR, N. LINIAL, M. SAKS: Collective coin flipping and other models of imperfect randomness
B. BOLLOBÁS: Martingales, isoperimetric inequalities and random graphs
J. T. M. VAN BON, A. E. BROUWER: The distance-regular antipodal covers of classical distance-regular graphs
A. BOUCHET: Representability of Delta-matroids
S. A. BURR, P. ERDÖS, R. J. FAUDREE, A. GYÁRFÁS, R. H. SCHELP: Extremal problems for degree sequences
I. J. DEJTER, V. NEUMANN-LARA: Unboundedness for generalized odd cyclic transversality
M. DE SOETE: Characterizations of the generalized quadrangle P(T_2(0), L): An overview
H. ENOMOTO, A. KANEKO, ZS. TUZA: P_3-factors and covering cycles in graphs of minimum degree n/3
A. FARAGÓ: f-independence number of graphs
R. J. FAUDREE, R. J. GOULD, M. S. JACOBSON, L. M. LESNIAK: Neighbourhood closures for graphs
R. J. FAUDREE, A. GYÁRFÁS, R. H. SCHELP: On graphs of irregularity strength 2
R. J. FAUDREE, J. LEHEL: Bound on the irregularity strength of regular graphs
D. G. FON-DER-FLAAS: On local complementations of graphs
E. GYÖRI: On the number of edge-disjoint triangles in graphs of given size
A. HAJNAL, P. KOMJATH, L. SOUKUP, I. SZALKAI: Decomposition of edge colored infinite complete graphs
D. HOLTON, M. D. PLUMMER: 2-extendability in 3-polytopes
C. A. J. HURKENS: On the diameter of the b-matching polytope
C. A. J. HURKENS, L. LOVÁSZ, A. SCHRIJVER, É. TARDOS: How to tidy up your set-system?
J. JEGIER, A. RYCERZ: Polyhedrality of integer monoids and slices
D. JUNGNICKEL, A. POTT: Two results on difference sets
S. KLAVZAR, M. PETKOVSEK: On characterizations with forbidden subgraphs
A. V. KOSTOCHKA: The nonexistence of certain generalised friendship graphs
J. KRATOCHVIL: Perfect codes in general graphs
H. LEFMANN: On intersecting families of finite affine and linear spaces over GF(q)
M. LOEBL, S. POLJAK: Bipartite packing
N. MANICKAM. D. MlKLÓS: On the number of non-negative partial sums of a non-negative sum
M. MANOUSSAKIS, Y. MANOUSSAKIS: Cycles in bipartite digraphs with given number of arcs
A. MEIR, J. W. MOON: On nodes of out-degree one in random trees
P. MIHÓK: On graphs critical with respect to generalized independence numbers
V. PETROVIC: Some unavoidable subgraphs of strong tournaments
S. PUURONEN: Efficient execution of a tabular rule-base representation
A. SALI: Extremal theorems for submatrices of a matrix
L. SÁNDOROVÁ, M. TRENKLER: On a generalization of magic graphs
A. SEBÖ: Dual integrality and multicommodity flows
M. SHRIKHANDE: Quasi-symmetric designs and quadratic polynomials
L. A. SZÉKELY: A note on identities and cube partitions
G. SZEKERES: A note on skew type orthogonal plusminus1 matrices
T. SZÖNYI: Arcs in cubic curves and 3-independent subsets of abelian groups
M. STIEBITZ: On k-critical n-chromatic graphs
S. TAZAWA: Enumeration of graphs with given number of vertices of odd degree
P. D. VESTERGAARD: Graphs whose one-edge deletions partition into two isomorphism classes
Z. BODÓ: How to add poly-log many numbers in constant depth
I. J. DEJTER: Vertex-specular covering graphs and their properties
P. ERDÖS, L. LOVÁSZ, K. VESZTERGOMBI: The chromatic number of the graph of large distances
P. ERDÖS, J. PACH, L. PYBER: Isomorphic subgraphs in a graph
I. HAVEL, J .-M. LABORDE: On distance monotone graphs
S. JENDROL: On 3-polytopal graphs with constant edge weight
L. K. JORGENSEN: On p vertices pairwise joined by edge-disjoint paths
J. SCHÖNHEIM: Infinite families of 4-chromatic edge-critical graphs
Problems
List of Participants