✦ LIBER ✦

Graph factors modulo k

✍ Scribed by Thomassen, Carsten

Book ID: 122138715
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 192 KB
Volume: 106
Category: Article
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2014.01.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On graph decompositions modulo k

✍ A.D. Scott 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 153 KB

We prove that, for every integer k >~ 2, every graph has an edge-partition into 5k 2 log k sets, each of which is the edge-set of a graph with all degrees congruent to 1 mod k. This answers a question of Pyber. Pyber proved that every graph G has an edge-partition into four sets, each of which is

Symplectic graphs modulo

✍ Li, Fenggao; Wang, Kaishun; Guo, Jun 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 227 KB

Cycles of length 0 modulo k in directed

Cycles of length 0 modulo k in directed graphs

✍ Noga Alon; N Linial 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 417 KB

Graph decomposition with applications to

Graph decomposition with applications to subdivisions and path systems modulo k

✍ Carsten Thomassen 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 585 KB

The existence of a function a(k) (where k is a natural number) is established such that the vertex set of any graph G of minimum degree at least a ( k ) has a decomposition A U B U C such that G(A) has minimum degree a t least k , each vertex of A is joined to at least k vertices of B, and no two ve

Representations of graphs modulo n

✍ Anthony B. Evans; Gerd H. Fricke; Carl C. Maneri; Terry A. McKee; Manley Perkel 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 757 KB

## Abstract A graph is representable modulo __n__ if its vertices can be labeled with distinct integers between 0 and __n__, the difference of the labels of two vertices being relatively prime to __n__ if and only if the vertices are adjacent. Erdős and Evans recently proved that every graph is rep