๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Recent examples in the theory of partition graphs

โœ Scribed by D.W. DeTemple; M.J. Dineen; J.M. Robertson; K.L. McAvaney


Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
298 KB
Volume
113
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Finite Induced Graph Ramsey Theory: On P
โœ D.S. Gunderson; V. Rodl; N.W. Sauer ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 425 KB

For given finite (unordered) graphs \(G\) and \(H\), we examine the existence of a Ramsey graph \(F\) for which the strong Ramsey arrow \(F \rightarrow(G)_{r}^{\prime \prime}\) holds. We concentrate on the situation when \(H\) is not a complete graph. The set of graphs \(G\) for which there exists a

Clique partitions of the cocktail party
โœ D.A Gregory; S McGuinness; W Wallis ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 369 KB

Let To denote the complement of a perfect matching in the complete graph on v vertices, v even, and let cp(To) be the minimum number of cliques needed to partition the edge-set of To. We prove that cp(To)>-v for v 1> 8 and give a design characterization of the cases where equality holds. We also sho