Proof of the bandwidth conjecture of Bollobás and Komlós (Q957895): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q105583359, #quickstatements; #temporary_batch_1707303357582
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.1007/s00208-008-0268-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1991646384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How tight is the Bollobás-Komlós conjecture? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding Arbitrary Graphs of Maximum Degree Two / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-factors in dense graphs / rank
 
Normal rank
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: Bandwidth, treewidth, separators, expansion, and universality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning 3-colourable subgraphs of small bandwidth in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ramsey number of a graph with bounded maximum degree / 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: Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-factors in dense bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / 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: The Blow-up Lemma / 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: Proof of the Seymour conjecture for large graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of the Alon-Yuster conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning Trees in Dense Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4878666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning triangulations in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical chromatic number and the complexity of perfect packings in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large planar subgraphs in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of a tiling conjecture of Komlós / rank
 
Normal rank

Revision as of 20:47, 28 June 2024

scientific article
Language Label Description Also known as
English
Proof of the bandwidth conjecture of Bollobás and Komlós
scientific article

    Statements

    Proof of the bandwidth conjecture of Bollobás and Komlós (English)
    0 references
    0 references
    0 references
    0 references
    1 December 2008
    0 references

    Identifiers