✦ LIBER ✦

Universal commutator graphs

✍ Scribed by Tomaž Pisanski

Book ID: 103059537
Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 178 KB
Volume: 78
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(89)90172-6

No coin nor oath required. For personal study only.

✦ Synopsis

Dedicated to the memory of Tory Parsons.

📜 SIMILAR VOLUMES

Universal light cone commutator

✍ R.A. Brandt 📂 Article 📅 1970 🏛 Elsevier Science 🌐 English ⚖ 372 KB

Universal graphs and induced-universal g

Universal graphs and induced-universal graphs

✍ Fan R. K. Chung 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 484 KB

## Abstract We construct graphs that contain all bounded‐degree trees on __n__ vertices as induced subgraphs and have only __cn__ edges for some constant __c__ depending only on the maximum degree. In general, we consider the problem of determining the graphs, so‐called universal graphs (or induced

Some universal graphs

✍ Peter Komjáth; Alan H. Mekler; János Pach 📂 Article 📅 1988 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 545 KB

ON UNIVERSAL GRAPHS

✍ F. R. K. Chung; R. L. Graham 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 221 KB

Coloring of universal graphs

✍ Peter Komjáth; Vojtèch Rödl 📂 Article 📅 1986 🏛 Springer Japan 🌐 English ⚖ 341 KB

Exotic n-universal graphs

✍ T. D. Parsons; Tomaž Pisanski 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 179 KB

An n-universal graph is a graph that contains as an induced subgraph a copy of every graph on n vertices It is shown that for each positive integer n > 1 there exists an n-universal graph G on 4" -1 vertices such that G IS a (v, k, A)-graph, and both G and its complement G are l-transitive in the se