Asymptotically optimal \(K_k\)-packings of dense graphs via fractional \(K_k\)-decompositions (Q2565683): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1997702119 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: math/0311449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing graphs: The packing problem solved / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near perfect coverings in graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5620621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer and fractional packings in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically good list-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a packing and covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The decomposition threshold for bipartite graphs with minimum degree one / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer and fractional packing of families of graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:49, 10 June 2024

scientific article
Language Label Description Also known as
English
Asymptotically optimal \(K_k\)-packings of dense graphs via fractional \(K_k\)-decompositions
scientific article

    Statements

    Identifiers