Skip to main content
Log in

Convex Sets in Acyclic Digraphs

  • Published:
Order Aims and scope Submit manuscript

Abstract

A non-empty set X of vertices of an acyclic digraph is called connected if the underlying undirected graph induced by X is connected and it is called convex if no two vertices of X are connected by a directed path in which some vertices are not in X. The set of convex sets (connected convex sets) of an acyclic digraph D is denoted by \(\mathcal{CO}(D) \ (\mathcal{CC}(D))\) and its size by co(D) (cc(D)). Gutin et al. (2008) conjectured that the sum of the sizes of all convex sets (connected convex sets) in D equals Θ(n · co(D)) (Θ(n · cc(D))) where n is the order of D. In this paper we exhibit a family of connected acyclic digraphs with \(\sum_{C\in \mathcal{CO}(D)}|C| = o(n\cdot \mathrm{co}(D))\) and \(\sum_{C\in \mathcal{CC}(D)}|C| = o(n\cdot \mathrm{cc}(D))\). We also show that the number of connected convex sets of order k in any connected acyclic digraph of order n is at least n − k + 1. This is a strengthening of a theorem of Gutin and Yeo.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Balister, P., Gerke, S., Gutin, G., Johnstone, A., Reddington, J., Scott, E., Soleimanfallah, A., Yeo, A.: Algorithms for generating convex sets in acyclic digraphs. J. Discret. Algorithms (2009, in press)

  2. Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications. Springer, London (2000)

    Google Scholar 

  3. Chen, X., Maskell, D.L., Sun, Y.: Fast identification of custom instructions for extensible processors. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 26, 359–368 (2007)

    Article  MATH  Google Scholar 

  4. Gutin, G., Johnstone, A., Reddington, J., Scott, E., Soleimanfallah, A., Yeo, A.: An algorithm for finding connected convex subgraphs of an acyclic digraph. In: Proc. ACiD’07 (Algorithms and Complexity in Durham). College Publications, Woodend (2008)

    Google Scholar 

  5. Gutin, G., Yeo, A.: On the number of connected convex subgraphs of a connected acyclic graph. Discrete Appl. Math. (2009, in press)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gregory Gutin.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Balister, P., Gerke, S. & Gutin, G. Convex Sets in Acyclic Digraphs. Order 26, 95–100 (2009). https://doi.org/10.1007/s11083-009-9109-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11083-009-9109-9

Keywords

Navigation