Minimal Oriented Graphs of Diameter 2

@article{Fredi1998MinimalOG,
  title={Minimal Oriented Graphs of Diameter 2},
  author={Zolt{\'a}n F{\"u}redi and Peter Hor{\'a}k and Chandra M. Pareek and Xuding Zhu},
  journal={Graphs and Combinatorics},
  year={1998},
  volume={14},
  pages={345-350}
}
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 nU f …n†U n log nÿ …3=2†n. 1. Oriented chromatic number An oriented graph is a digraph without opposite arcs, i.e., every pair of vertices is connected by at most one arc. An oriented colouring of an oriented graph D is a colouring of its vertices so that every colour class is an independent set, moreover for any two colour classes U and V , all the arcs… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 13 references

Hajnal's triangle-free game and extremal graph problems

Z. FuÈredi, D. Reimer, Seress, . AÂ
Congressus Numerantium 82, 123±128 • 1991

Matchings and covers in hypergraphs

Z. FuÈredi
Graphs Comb. 4, 115±206 • 1988

Arc-minimal digraphs of speci®ed diameter

R. Dawes, H. Meijer
J. Comb. Math. and Comb. Comput. 1, 85±96 • 1987
View 3 Excerpts

Graphs and hypergraphs

C. Berge
1973

The minimal number of edges of a directed graph with given diameter

ZnaÂm, . SÏ
Acta Fac. Rerum Natur. Univ. Comenian. Math. Publ. 24, 181±185 • 1970
View 3 Excerpts

Similar Papers

Loading similar papers…