Proof of the Seymour conjecture for large graphs (Q1272361): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(6 intermediate revisions by 5 users not shown) | |||
Property / author | |||
Property / author: János Komlós / rank | |||
Property / author | |||
Property / author: Q793744 / rank | |||
Property / author | |||
Property / author: János Komlós / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Endre Szemerédi / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q60060518 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some Theorems on Abstract Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Square of a Hamiltonian Cycle / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The square of paths and cycles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hamiltonian square-paths / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Proof of a Packing Conjecture of Bollobás / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Blow-up lemma / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the square of a Hamiltonian cycle in dense graphs / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf01626028 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2017776863 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 08:26, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Proof of the Seymour conjecture for large graphs |
scientific article |
Statements
Proof of the Seymour conjecture for large graphs (English)
0 references
18 May 1999
0 references
dense graphs
0 references
Hamiltonian cycle
0 references