Proof of a tiling conjecture of Komlós (Q4434471): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Almost \(H\)-factors in dense graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: \(H\)-factors in dense graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the maximal number of independent circuits in a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some Theorems on Abstract Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On circuits in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Tiling Turán theorems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Blow-up lemma / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An algorithmic version of the blow-up lemma / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Proof of the Alon-Yuster conjecture / rank | |||
Normal rank |
Latest revision as of 12:17, 6 June 2024
scientific article; zbMATH DE number 2002086
Language | Label | Description | Also known as |
---|---|---|---|
English | Proof of a tiling conjecture of Komlós |
scientific article; zbMATH DE number 2002086 |
Statements
Proof of a tiling conjecture of Komlós (English)
0 references
10 November 2003
0 references
tiling
0 references
regularity lemma
0 references
blow-up lemma
0 references
critical chromatic number
0 references