Rainbow matchings and Hamilton cycles in random graphs (Q2811161): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lopsided Lovász Local lemma and Latin transversals / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Loose Hamilton cycles in random 3-uniform hypergraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Rainbow hamilton cycles in random graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Rainbow Hamilton cycles in random regular graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Factors in random graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Rainbow Perfect Matchings in Complete Bipartite Graphs: Existence and Counting / rank | |||
Normal rank |
Revision as of 02:54, 12 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Rainbow matchings and Hamilton cycles in random graphs |
scientific article |
Statements
Rainbow matchings and Hamilton cycles in random graphs (English)
0 references
10 June 2016
0 references
random hypergraphs
0 references
perfect matchings
0 references
rainbow colorings
0 references
Latin transversal
0 references
0 references