Minimum degree conditions for large subgraphs (Q2851441): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.endm.2009.07.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2058358278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the bandwidth conjecture of Bollobás and Komlós / 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 the structure of linear graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5620621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tiling Turán theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the square of a Hamiltonian cycle in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the Seymour conjecture for large graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum degree threshold for perfect graph packings / rank
 
Normal rank

Latest revision as of 23:22, 6 July 2024

scientific article
Language Label Description Also known as
English
Minimum degree conditions for large subgraphs
scientific article

    Statements