Combinatorics, Geometry and Probability: A Tribute to Paul Erdös Book

	Preface
	Farewell to Paul Erdos
	Toast to Paul Erdos
	List of Contributors
	Paul Erdos: Some Unsolved Problems	1
	Menger's Theorem for a Countable Source Set	11
	On Extremal Set Partitions in Cartesian Product Spaces	23
	Matchings in Lattice Graphs and Hamming Graphs	33
	Reconstructing a Graph from its Neighborhood Lists	51
	Threshold Functions for H-factors	63
	A Rate for the Erdos Turan Law	71
	Deterministic Graph Games and a Probabilistic Intuition	81
	On Oriented Embedding of the Binary Tree into the Hypercube	95
	Potential Theory on Distance-Regular Graphs	107
	On the Length of the Longest Increasing Subsequence in a Random Permutation	121
	On Richardson's Model on the Hypercube	129
	Random Permutations: Some Group-Theoretic Aspects	139
	Ramsey Problems with Bounded Degree Spread	145
	Hamilton Cycles in Random Regular Digraphs	153
	On Triangle Contact Graphs	165
	A Combinatorial Approach to Complexity Theory via Ordinal Hierarchies	179
	Lattice Points of Cut Cones	193
	The Growth of Infinite Graphs: Boundedness and Finite Spreading	217
	Amalgamated Factorizations of Complete Graphs	223
	Ramsey Size Linear Graphs	241
	Turan Ramsey Theorems and K[subscript p]-Independence Numbers	253
	Nearly Equal Distances in the Plane	283
	Clique Partitions of Chordal Graphs	291
	On Intersecting Chains in Boolean Algebras	299
	On the Maximum Number of Triangles in Wheel-Free Graphs	305
	Blocking Sets in SQS (2v)	319
	(1,2)-Factorizations of General Fulerian Nearly Regular Graphs	329
	Oriented Hamilton Cycles in Oriented Graphs	339
	Minimization Problems for Infinite n-Connected Graphs	355
	On Universal Threshold Graphs	375
	Image Partition Regularity of Matrices	393
	Extremal Graph Problems for Graphs with a Color-Critical Vertex	421
	A Note on [omega] [subscript 1] [actual symbol not reproducible] [omega] [subscript 1] Functions	435
	Topological Cliques in Graphs	439
	Local-Global Phenomena in Graphs	449
	On Random Generation of the Symmetric Group	463
	On Vertex-Edge-Critically n-Connected Graphs	471
	On a Conjecture of Erdos and Cudakov	487
	A Random Recolouring Method for Graphs and Hypergraphs	489
	Obstructions for the Disk and the Cylinder Embedding Extension Problems	493
	A Ramsey-Type Theorem in the Plane	525
	The Enumeration of Self-Avoiding Walks and Domains on a Lattice	535
	An Extension of Foster's Network Theorem	541
	Randomised Approximation in the Tutte Plane	549
	On Crossing Numbers, and some Unsolved Problems	557