Perfect Matchings in the Semirandom Graph Process (Q5864217): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / arXiv ID | |||
Property / arXiv ID: 2105.13455 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Very fast construction of bounded-degree spanning graphs via the semi-random graph process / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Semi‐random graph process / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hamilton cycles in 3-out / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hamilton cycles in the semi-random graph process / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Corrigendum to: ``Existence of a perfect matching in a random \((1+e^{-1})\)-out bipartite graph'' / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4938890 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W3170779178 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 10:02, 30 July 2024
scientific article; zbMATH DE number 7537557
Language | Label | Description | Also known as |
---|---|---|---|
English | Perfect Matchings in the Semirandom Graph Process |
scientific article; zbMATH DE number 7537557 |
Statements
Perfect Matchings in the Semirandom Graph Process (English)
0 references
3 June 2022
0 references
semirandom process
0 references
perfect matchings
0 references
random graphs
0 references
0 references
0 references