𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The representation number of some sparse graphs

✍ Scribed by Reza Akhtar

Book ID
119227540
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
266 KB
Volume
312
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The number of connected sparsely edged g
The number of connected sparsely edged graphs
✍ E. M. Wright πŸ“‚ Article πŸ“… 1977 πŸ› John Wiley and Sons 🌐 English βš– 472 KB

## Abstract An (__n, q__) graph has __n__ labeled points, __q__ edges, and no loops or multiple edges. The number of connected (__n, q__) graphs is __f(n, q)__. Cayley proved that __f(n, n__^‐1^) = __n__^nβˆ’2^ and Renyi found a formula for __f(n, n)__. Here I develop two methods to calculate the exp

Linear Ramsey numbers of sparse graphs
Linear Ramsey numbers of sparse graphs
✍ Lingsheng Shi πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 102 KB

## Abstract The Ramsey number __R__(__G__~1~,__G__~2~) of two graphs __G__~1~ and __G__~2~ is the least integer __p__ so that either a graph __G__ of order __p__ contains a copy of __G__~1~ or its complement __G__^c^ contains a copy of __G__~2~. In 1973, Burr and ErdΕ‘s offered a total of $25 for se

On the Ramsey Number of Sparse 3-Graphs
On the Ramsey Number of Sparse 3-Graphs
✍ Brendan Nagle; Sayaka Olsen; VojtΔ›ch RΓΆdl; Mathias Schacht πŸ“‚ Article πŸ“… 2008 πŸ› Springer Japan 🌐 English βš– 246 KB
The number of connected sparsely edged g
The number of connected sparsely edged graphs. IV large nonseparable graphs
✍ E. M. Wright πŸ“‚ Article πŸ“… 1983 πŸ› John Wiley and Sons 🌐 English βš– 306 KB

The number of nonseparable graphs on n labeled points and q lines is u(n, 9). In the second paper of this series an exact formula for u(n, n + k) was found for general n and successive (small) k. The method would give an asymptotic approximation for fixed k as n + 30. Here an asymptotic approximatio