On rainbow trees and cycles.
Frieze, Alan, Krivelevich, Michael (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Multicoloured Hamilton cycles.”
On rainbow trees and cycles.
Clusters in a multigraph with elevated density.
Goldberg, Mark K. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Colouring 4-cycle systems with specified block colour patterns: The case of embedding -designs.
Quattrocchi, Gaetano (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Circular chromatic index of generalized Blanuša snarks.
Ghebleh, Mohammad (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On a problem of R. Häggkvist concerning edge-colourings of graphs
Bohdan Zelinka (1978)
Časopis pro pěstování matematiky
Similarity:
A note on edge-colourings avoiding rainbow and monochromatic .
Jungić, Veselin, Kaiser, Tomás, Král', Daniel (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Heterochromatic matchings in edge-colored graphs.
Wang, Guanghui, Li, Hao (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Equitable colorations of graphs
D. de Werra (1971)
ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique
Similarity:
On colorings avoiding a rainbow cycle and a fixed monochromatic subgraph.
Axenovich, Maria, Choi, JiHyeok (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Fans and bundles in the graph of pairwise sums and products.
Halbeisen, Lorenz (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Maximum Hypergraphs without Regular Subgraphs
Jaehoon Kim, Alexandr V. Kostochka (2014)
Discussiones Mathematicae Graph Theory
Similarity:
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.