论文信息 - Minimal Oriented Graphs of Diameter 2 - 字舞流文

Minimal Oriented Graphs of Diameter 2

Abstract. Let f(n) be the minimum number of arcs among oriented graphs of order n and diameter 2. Here it is shown for n>8 that (1−o(1))n log n≤f(n)≤n log n−(3/2)n.

Zoltán Füredi | Xuding Zhu | Peter Horák | Chandra M. Pareek | Xuding Zhu | Z. Füredi | P. Horák | Chandra M. Pareek

[1] Claude Berge,et al. Graphs and Hypergraphs , 2021, Clustering.

[2] B. Bollobás. On generalized graphs , 1965 .

[3] Alexandr V. Kostochka,et al. Acyclic and oriented chromatic numbers of graphs , 1997 .

[4] Brian Alspach,et al. Mutually disjoint families of 0-1 sequences , 1975, Discret. Math..

[5] Zsolt Tuza,et al. Inequalities for two set systems with prescribed intersections , 1987, Graphs Comb..

[6] Bruno Courcelle,et al. The Monadic Second-order Logic of Graphs VI: On Several Representations of Graphs by Relational Structures , 1995, Discret. Appl. Math..

[7] Zoltán Füredi,et al. Matchings and covers in hypergraphs , 1988, Graphs Comb..

[8] A. Rényii,et al. ON A PROBLEM OF GRAPH THEORY , 1966 .

[9] N. Alon,et al. Homomorphisms of Edge-Colored Graphs and Coxeter Groups , 1998 .