A Hypergraph Version of a Graph Packing Theorem by Bollobás and Eldridge (Q2853340): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Q178710 / rank
Normal rank
 
Property / author
 
Property / author: Alexandr V. Kostochka / rank
 
Normal rank
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.1002/jgt.21706 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2123213912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packings of graphs and applications to computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraphs of graphs. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing of nonuniform hypergrahs- product and sum of sizes conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on packing of two copies of a hypergraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5403007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge disjoint placement of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing two graphs of order n having total size at most 2n-2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4340018 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing of graphs - a survey / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:48, 6 July 2024

scientific article
Language Label Description Also known as
English
A Hypergraph Version of a Graph Packing Theorem by Bollobás and Eldridge
scientific article

    Statements