✦ LIBER ✦

Almost all Cayley graphs have diameter 2

✍ Scribed by Jixiang Meng; Qiongxiang Huang

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 118 KB
Volume: 178
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(97)81836-5

No coin nor oath required. For personal study only.

✦ Synopsis

We prove that almost all Cayley graphs have diameter 2.

📜 SIMILAR VOLUMES

Almost all steinhaus graphs have diamete

Almost all steinhaus graphs have diameter 2

✍ Neal Brand 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 300 KB 👁 1 views

## Abstract A Steinhaus graph is a graph with __n__ vertices whose adjacency matrix (__a__~i, j~) satisfies the condition that __a__~i, j~  __a__~a‐‐1, j‐‐1~ + __a__ ~i‐‐1, j~ (mod 2) for each 1 < __i__ < __j__ ≤ __n__. It is clear that a Steinhaus graph is determined by its first row. In [3] Brin

Almost all Cayley graphs are hamiltonian

✍ Meng Jixiang; Huang Qiongxiang 📂 Article 📅 1996 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 278 KB

The diameters of almost all Cayley digra

The diameters of almost all Cayley digraphs

✍ Jixiang Meng; Xin Liu 📂 Article 📅 1997 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 238 KB

Almost all quasigroups have rank 2

✍ Peter J. Cameron 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 316 KB

Almost all trees have tribe number 2 or

Almost all trees have tribe number 2 or 3

✍ J. Komlós; W.O.J. Moser 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 301 KB

Let T be a tree on n vertices, and let E <$ be a small fixed positive number. The tribe number t&) of T is the smallest integer r such that when any vertex is deleted, some r or fewer subtrees in the resulting forest together contain more than (1-e)n vertices. We prove the following, theorem: Almost

Almost all graphs with high girth and su

Almost all graphs with high girth and suitable density have high chromatic number

✍ Deryk Osthus; Hans Jürgen Prömel; Anusch Taraz 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 85 KB 👁 1 views

## Abstract Erdös proved that there exist graphs of arbitrarily high girth and arbitrarily high chromatic number. We give a different proof (but also using the probabilistic method) that also yields the following result on the typical asymptotic structure of graphs of high girth: for all ℓ ≥ 3 and