Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference16 articles.
1. D. Avis, P. Erdős, andJ. Pach: Repeated distances in space,Graphs and Combinatorics,4 (1988), 207–217.
2. B. Bollobás:Extremal Graph Theory, Academic Press, London,1978.
3. B. Bollobás, P. Erdős, S. Simonovits, andE. Szemerédi: Extremal graphs without large forbidden subgraphs, in:Advances in Graph Theory, Ann. Discr. Math.,3 (1978), 29–41.
4. W. G.Brown, and F.Harary: Extremal digraphs, in:Combinatorial Theory and its Applications (Erdős et al, eds.),Coll. Math. Soc. J. Bolyai,4, North-Holland, 1970, 135–198.
5. W. G. Brown, andM. Simonovits: Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures,Discr. Math.,48 (1984), 147–162.
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Favourite Distances in $3$-Space;The Electronic Journal of Combinatorics;2020-05-15
2. A product inequality for extreme distances;Computational Geometry;2019-12
3. Combinatorial Distance Geometry in Normed Spaces;Bolyai Society Mathematical Studies;2018
4. Cliques and cycles in distance graphs and graphs of diameters;Contemporary Mathematics;2014
5. On Schurʼs conjecture;Electronic Notes in Discrete Mathematics;2013-11