Decompositions into Subgraphs of Small Diameter
From MaRDI portal
Publication:4911111
DOI10.1017/S0963548310000040zbMath1260.05049arXiv0906.3530MaRDI QIDQ4911111
Publication date: 13 March 2013
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0906.3530
05C65: Hypergraphs
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C12: Distance in graphs
Related Items
Cites Work
- Kneser's conjecture, chromatic number, and homotopy
- Supersaturated graphs and hypergraphs
- Short paths in \(\varepsilon \)-regular pairs and small diameter decompositions of dense graphs
- Radius, diameter, and minimum degree
- How to decrease the diameter of triangle-free graphs
- Low diameter graph decompositions
- A correlation inequality for bipartite graphs
- Short paths in quasi-random triple systems with sparse underlying graphs
- Decreasing the diameter of bounded degree graphs
- Diameter bounds for altered graphs