Displaying similar documents to “Multicoloured Hamilton cycles.”

On rainbow trees and cycles.

Frieze, Alan, Krivelevich, Michael (2008)

The Electronic Journal of Combinatorics [electronic only]


Equitable colorations of graphs

D. de Werra (1971)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique


Maximum Hypergraphs without Regular Subgraphs

Jaehoon Kim, Alexandr V. Kostochka (2014)

Discussiones Mathematicae Graph Theory


We show that an n-vertex hypergraph with no r-regular subgraphs has at most 2n−1+r−2 edges. We conjecture that if n > r, then every n-vertex hypergraph with no r-regular subgraphs having the maximum number of edges contains a full star, that is, 2n−1 distinct edges containing a given vertex. We prove this conjecture for n ≥ 425. The condition that n > r cannot be weakened.