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

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1002/jgt.21706
@@ Property / full work available at URL: https://doi.org/10.1002/jgt.21706 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2123213912
@@ Property / OpenAlex ID: W2123213912 / rank @@
+Normal rank
@@ Property / cites work @@
+Packings of graphs and applications to computational complexity
+Normal rank
@@ Property / cites work @@
+Subgraphs of graphs. I
@@ Property / cites work: Subgraphs of graphs. I / rank @@
+Normal rank
@@ Property / cites work @@
+Packing of nonuniform hypergrahs- product and sum of sizes conditions
+Normal rank
@@ Property / cites work @@
+A note on packing of two copies of a hypergraph
@@ Property / cites work: A note on packing of two copies of a hypergraph / rank @@
+Normal rank
@@ Property / cites work @@
+Q5403007
@@ Property / cites work: Q5403007 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge disjoint placement of graphs
@@ Property / cites work: Edge disjoint placement of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Packing two graphs of order n having total size at most 2n-2
+Normal rank
@@ Property / cites work @@
+Q4340018
@@ Property / cites work: Q4340018 / rank @@
+Normal rank
@@ Property / cites work @@
+Packing of graphs - a survey
@@ Property / cites work: Packing of graphs - a survey / rank @@
+Normal rank