Clumsy packings of graphs
From MaRDI portal
Publication:2001970
zbMath1416.05221arXiv1807.05041MaRDI QIDQ2001970
Anika Kaufmann (Kaplan), Raphael Yuster, Maria A. Axenovich
Publication date: 11 July 2019
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.05041
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Unnamed Item
- Packing polyominoes clumsily
- Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
- Some Turán type results on the hypercube
- Near perfect coverings in graphs and hypergraphs
- Ramanujan graphs
- Clumsy packing of dominoes
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Polarities and \(2k\)-cycle-free graphs
- Nearly perfect matchings in regular simple hypergraphs
- Packing graphs: The packing problem solved
- Packing and decomposition of graphs with trees
- Turán’s Theorem in the Hypercube
- On a problem of K. Zarankiewicz
- Edge-decompositions of graphs with high minimum degree
This page was built for publication: Clumsy packings of graphs
