Sets, graphs, and numbers Book

	Contents	3
	Preface	7
	On an anti-Ramsey type result	9
	Randomness of n[actual symbols not reproducible]2 mod 1 and a Ramsey property of the hyperbola	23
	The q-perfect graphs. Part I. The case q = 2	67
	Rado's theorem for finite fields	77
	On superspherical graphs	89
	Some developments of the Erdos-Ginzburg-Ziv theorem I	97
	On the maximum densities of j-th smallest distances	119
	On the number of solutions of Thue's equation	127
	The maximum size of 4- and 6-cycle free bipartite graphs on m, n vertices	135
	Latency hiding for fault-tolerant PRAM computations	143
	Extreme hypermetrics and L-polytopes	157
	Partition theorems for the power set	211
	Size Ramsey functions	219
	How many edges should be deleted to make a triangle-free graph bipartite?	239
	On the intersection of independence systems	265
	Projective spaces and colorings of K[subscript m] x K[subscript n]	273
	Sumsets and powers of 2	279
	Noise perturbations of random mappings tend to produce rapid mixing	287
	Interval orders and shift graphs	297
	The birth of a mathematical theory in British India	315
	On Runge's theorem about diophantine equations	329
	Edge disjoint cliques in graphs	357
	On arithmetic graphs associated with integral domains, II	365
	Decision tree complexity of boolean functions	375
	Ramsey numbers for graph sets with fixed numbers of edges	391
	On extremal problems concerning weights of edges of graphs	399
	The long club [actual symbol not reproducible]	411
	Long stars specify [Chi]-bounded classes	421
	A semi-integral total colouring	429
	The chromatic number of some uncountable graphs	439
	Note on a problem concerning nuclei	445
	Counting of path-like objects in a rectangular array	451
	First distributed sets in the association scheme of bilinear forms	465
	Antichain decompositions of a partially ordered set	469
	Connected triangle-free (1,2)-realizable graphs	499
	Counting domino arrangements	507
	An integral representation for eulerian numbers	513
	Constructions of low-discrepancy point sets and sequences	529
	The Pell sequence contains only trivial perfect powers	561
	Polyhedral and eigenvalue approximations of the maxcut problem	569
	Covering the edges of a graph by	583
	Nonuniform random recursive trees with bounded degree	611
	On an inequality of Erdos and Turan concerning uniform distribution modulo one I	621
	Graphs which do not embed a given graph and the Ramsey property	631
	Strong partition realations below the power set: Consistency; Was Sierpinski right? II	637
	Sum graphs of small sum number	669
	Sparse random graphs: A continuum of complete theories	679
	The graph algebra of skew Hadamard determinants	691
	Combinatorial properties of certain classes of 3-polytopal planar graphs	699
	Decompositions into subhypergraphs with the Konig property	705
	On the number of knots and links	713
	Orientations of Hamiltonian cycles in bipartite digraphs	719
	A note on embedding graphs without small cycles	727
	A 11/8-approximation algorithm for the Steiner problem on networks with rectilinear distance	733
	List of Participants	747