✦ LIBER ✦

Quasi-randomness and the distribution of copies of a fixed graph

✍ Scribed by Asaf Shapira

Publisher: Springer-Verlag
Year: 2008
Tongue: English
Weight: 518 KB
Volume: 28
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s00493-008-2375-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Quasi-randomness is determined by the di

Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets

✍ Raphael Yuster 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 378 KB

Matching and covering the vertices of a

Matching and covering the vertices of a random graph by copies of a given graph

✍ Andrzej Ruciński 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 747 KB

## Rucidski, A., Matching and covering the vertices of a random graph by copies of a given graph, Discrete Mathematics 105 (1992) 185-197. In this paper we partially answer the question: how slowly must p(n) converge to 0 so that a random graph K(n, p) has property PM, almost surely, where PM, me

Packing of three copies of a graph

✍ Wang, Hong; Sauer, Norbert 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 460 KB 👁 1 views

A graph of order n is said to be 3-placeable if there are three edge-disjoint copies of this graph in K,,. An ( n , n -1)-graph is a graph of order n with n -1 edges. In this paper w e characterize all the (n, n -1)-graphs which contain no cycles of length 3 or 4 and which are 3-placeable.

The distribution of the maximum degree o

The distribution of the maximum degree of a random graph

✍ Béla Bollobás 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 184 KB

Consider I:andom graphs with n labelled vertices in which the edges are chosen independently and with a 6lxed probability p, 0 <p C 1. Let y be a fixed real number, q = 1p, and denote by A the maximum degree. Then

The distribution of clusters in random g

The distribution of clusters in random graphs

✍ Richard Arratia; Eric S Lander 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 697 KB

Reconstructing the number of copies of a

Reconstructing the number of copies of a valency-labeled finite graph in an infinite graph

✍ A. J. H. King; C. St. J. A. Nash-Williams 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 489 KB 👁 1 views

## Abstract Suppose that __G, H__ are infinite graphs and there is a bijection Ψ; V(G) Ψ V(H) such that __G__ ‐ ξ ≅ H ‐ Ψ(ξ) for every ξ ∼ __V__(G). Let __J__ be a finite graph and /(π) be a cardinal number for each π ≅ __V__(J). Suppose also that either /(π) is infinite for every π ≅ __V__(J) or _