✦ LIBER ✦

The structure of sets with few sums along a graph

✍ Scribed by György Elekes; Imre Z. Ruzsa

Book ID: 108167176
Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 225 KB
Volume: 113
Category: Article
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2005.10.011

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the structure of graphs with few P4s

✍ Luitpold Babel; Stephan Olariu 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 984 KB

We present new classes of graphs for which the isomorphism problem can be solved in polynomial time. These graphs are characterized by containing -in some local sense -only a small number of induced paths of length three. As it turns out, every such graph has a unique tree representation: the intern

On the structure of a random sum-free se

On the structure of a random sum-free set

✍ Peter J. Cameron 📂 Article 📅 1987 🏛 Springer 🌐 English ⚖ 407 KB

On the structure of a random sum-free se

On the structure of a random sum-free set of positive integers

✍ Neil J. Calkin 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 390 KB

The Number of Independent Sets in a Grap

The Number of Independent Sets in a Graph with Small Maximum Degree

✍ David Galvin; Yufei Zhao 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 180 KB

Coloring the Vertices of a Graph With Me

Coloring the Vertices of a Graph With Measurable Sets in a Probability Space

✍ P.D. Johnson Jr.; C.A. Rodger 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 360 KB

Covering the edge set of a directed grap

Covering the edge set of a directed graph with trees

✍ K. Vidyasankar 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 580 KB