Some inequalities for orderings of acyclic digraphs
DOI:
https://doi.org/10.11575/cdm.v13i1.62554Keywords:
(partially) ordered set, digraph, acyclic ordering, linear extension, order dimension twoAbstract
Let $D=(V,A)$ be an acyclic digraph. For $x\in V$ define $e_{_{D}}(x)$ to be the difference of the indegree and the outdegree of $x$. An acyclic ordering of the vertices of $D$ is a one-to-one map $g: V \rightarrow [1,|V|] $ that has the property that for all $x,y\in V$ if $(x,y)\in A$, then $g(x) < g(y)$.We prove that for every acyclic ordering $g$ of $D$ the following inequality holds:
\[\sum_{x\in V} e_{_{D}}(x)\cdot g(x) ~\geq~ \frac{1}{2} \sum_{x\in V}[e_{_{D}}(x)]^2~.\]
The class of acyclic digraphs for which equality holds is determined as the class of comparability digraphs of posets of order dimension two.
References
2. J. Bang-Jensen and G. Gutin, Digraphs, Springer Monographs in Mathematics, Springer-Verlag London, Ltd., London, 2001, Theory, algorithms and applications.
3. T. Bier, Some inequalities for linear extensions of posets and ideals, Algebras and combinatorics (Hong Kong, 1997), Springer, Singapore, 1999, pp. 25-36.
4. G. Brightwell and V. Patel, Average relational distance in linear extensions of posets, Discrete Math. 310 (2010), no. 5, 1016-1021.
5. B. Dushnik and E. W. Miller, Partially ordered sets, Amer. J. Math. 63 (1941), 600-610.
6. D. Howard, R. Shull, N. Streib, and A. N. Trenk, The total linear discrepancy of an ordered set, Discrete Math. 310 (2010), no. 5, 1022-1025.
7. D. Kelly, The 3-irreducible partially ordered sets, Canad. J. Math. 29 (1977), no. 2, 367-383.
8. N. Streib, Dimension preserving contractions and a nite list of 3-irreducible posets, Order 29 (2012), no. 1, 165-176.
9. E. Szpilrajn, Sur l'extension de l'ordre partiel, Fundamenta Mathematicae 16 (1930), no. 1, 386-389.
10. W. T. Trotter Jr. and J. I. Moore Jr., Characterization problems for graphs, partially ordered sets, lattices, and families of sets, Discrete Math. 16 (1976), no. 4, 361-381.
Downloads
Published
Issue
Section
License
This copyright statement was adapted from the statement for the University of Calgary Repository and from the statement for the Electronic Journal of Combinatorics (with permission).
The copyright policy for Contributions to Discrete Mathematics (CDM) is changed for all articles appearing in issues of the journal starting from Volume 15 Number 3.
Author(s) retain copyright over submissions published starting from Volume 15 number 3. When the author(s) indicate approval of the finalized version of the article provided by the technical editors of the journal and indicate approval, they grant to Contributions to Discrete Mathematics (CDM) a world-wide, irrevocable, royalty free, non-exclusive license as described below:
The author(s) grant to CDM the right to reproduce, translate (as defined below), and/or distribute the material, including the abstract, in print and electronic format, including but not limited to audio or video.
The author(s) agree that the journal may translate, without changing the content the material, to any medium or format for the purposes of preservation.
The author(s) also agree that the journal may keep more than one copy of the article for the purposes of security, back-up, and preservation.
In granting the journal this license the author(s) warrant that the work is their original work and that they have the right to grant the rights contained in this license.
The authors represent that the work does not, to the best of their knowledge, infringe upon anyone’s copyright.
If the work contains material for which the author(s) do not hold copyright, the author(s) represent that the unrestricted permission of the copyright holder(s) to grant CDM the rights required by this license has been obtained, and that such third-party owned material is clearly identified and acknowledged within the text or content of the work.
The author(s) agree to ensure, to the extent reasonably possible, that further publication of the Work, with the same or substantially the same content, will acknowledge prior publication in CDM.
The journal highly recommends that the work be published with a Creative Commons license. Unless otherwise arranged at the time the finalized version is approved and the licence granted with CDM, the work will appear with the CC-BY-ND logo. Here is the site to get more detail, and an excerpt from the site about the CC-BY-ND. https://creativecommons.org/licenses/
Attribution-NoDerivs
CC BY-ND
This license lets others reuse the work for any purpose, including commercially; however, it cannot be shared with others in adapted form, and credit must be provided to you.