A Turán-type problem on distances in graphs
From MaRDI portal
Publication:2637738
DOI10.1007/s00373-012-1225-4zbMath1290.05069arXiv1011.2450MaRDI QIDQ2637738
Mykhaylo Tyomkyn, Andrew J. Uzzell
Publication date: 14 February 2014
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1011.2450
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a poset of trees
- On the number of certain subgraphs contained in graphs with a given number of edges
- On the number of subgraphs of prescribed type of graphs with a given number of edges
- Paths of length four
- Rearrangements of \((0,-1)\) matrices
- Walks and paths in trees
- Graphs with maximal number of adjacent pairs of edges
- Paths in graphs
- Turan's Graph Theorem