A Hypergraph Version of a Graph Packing Theorem by Bollobás and Eldridge (Q2853340): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
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 |
Latest revision as of 22: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
A Hypergraph Version of a Graph Packing Theorem by Bollobás and Eldridge (English)
0 references
21 October 2013
0 references
graph packing
0 references
hypergraph
0 references