𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Counting Sets With Small Sumset, And The Clique Number Of Random Cayley Graphs

✍ Scribed by Ben Green*

Publisher
Springer-Verlag
Year
2005
Tongue
English
Weight
282 KB
Volume
25
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Ramsey number of trees versus gra
On the Ramsey number of trees versus graphs with large clique number
✍ Ronald J. Gould; Michael S. Jacobson πŸ“‚ Article πŸ“… 1983 πŸ› John Wiley and Sons 🌐 English βš– 335 KB

Chvatal established that r(T,, K,,) = (m -1 ) ( n -1 ) + 1, where T, , , is an arbitrary tree of order m and K, is the complete graph of order n. This result was extended by Chartrand, Gould, and Polimeni who showed K, could be replaced by a graph with clique number n and order n + 5 provided n 2 3

Graphs with given odd sets and the least
Graphs with given odd sets and the least number of vertices
✍ Louis Hakimi, S. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 64 KB πŸ‘ 2 views

This note presents a solution to the following problem posed by Chen, Schelp, and SoltΓ©s: find a simple graph with the least number of vertices for which only the degrees of the vertices that appear an odd number of times are given.

On the Hosoya index and the Merrifield–S
On the Hosoya index and the Merrifield–Simmons index of graphs with a given clique number
✍ Kexiang Xu πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 377 KB

The Hosoya index and the Merrifield-Simmons index of a graph are defined as the total number of the matchings (including the empty edge set) and the total number of the independent vertex sets (including the empty vertex set) of the graph, respectively. Let W n,k be the set of connected graphs with