Permutations avoiding connected graphs
DOI:
https://doi.org/10.11575/cdm.v12i2.62745Abstract
There is a permutation of the vertices of a tree for which no proper subtree on at least two vertices is mapped to a subtree, if and only if twice the number of its endpoints is less than or equal to the number of points of the tree;
Theorem 4.1. The following more general result follows:Let G = (V (G), E(G)) be a simple graph and let C(G) be the set of subsets
A V (G) which induce a connected subgraph of G containing at least two vertices and let Π(G) be the set of permutations of V (G) which do not map an element of C(G) to an element of C(G). In the case where G has n vertices and at most n − 1 edges we give a necessary and sufficient condition on G so that Π(G) [SPECIAL CHARACTER]= ∅.
AMS subject classification (2000): 05C70
References
B. Bollobas and S. E. Eldridge, Packing of graphs and applications to computational complexity, J. Comb. Theory, Ser. B 25 (1978), 105-124.
D. Burns and S. Schuster, Every (p; p [SPECIAL CHARACTER] 2) graph is contained in its complement, J. Graph Theory 1 (1977), 277-279.
D. Burns and S. Schuster , Embedding (n; n[SPECIAL CHARACTER]1) graphs in their complements, Israel J. Math. 30 (1978), 313-320.
C. T. Cheng, On computing the distinguishing numbers of trees and forests, Electron. J. Combin. 31 (2006), #R11.
J. Demetrovics, M. Miyakawa, I. G. Rosenberg, D. A. Simovici, and I. Stojmenovic, Intersections of isotone clones on a nite set, Proc. 20th Internat. Symp. Multiplevalued Logic (Charlotte, NC), 1990, pp. 248-253.
J. Demetrovics and L. Ronyai, A note on intersections of isotone clones, Acta Cybernet. 10 (1992), no. 3, 217-220.
N. Eaton, A near packing of two graphs, J. Comb. Theory, Ser. B 80 (2000), 98-103.
R. Fraisse, Theory of relations, revised ed., Studies in Logic and the Foundations of Mathematics, vol. 145, North Holland, 2000.
W. Hodges, Model theory, Encyclopedia of Mathematics and its Applications, vol. 42, Cambridge University Press, London, 1994.
W. Imrich, S. Klavzar, and V. Tromov, Distinguishing innite graphs, Electron. J. Combin. 14 (2007), #R36.
C. Lafamme, L. Nguyen Van The, and N. Sauer, Distinguishing number of countable homogeneous relational structures, Electron. J. Combin. 17 (2010), #1.
F. Langer and R. Poschel., Relational systems with trivial endomorphisms and polymorphisms, J. Pure Appl. Algebra. 2 (1984), 129{142.
A. Marcus and G. Tardos, Excluded permutation matrices and the Stanley-Wilf conjecture, J. Combin. Theory, Ser. A 107 (2004), 153-160.
A. Nozaki, M. Miyakawa, G. Pogosyan, and I. Rosenberg, The number of orthogonal permutations, European J. Combin. 16 (1995), #1.
P. P. Palfy, Unary polynomial in algebra I., Algebra Universalis 18 (1984), 162-173.
I. Rival and N. Zaguia, Perpendicular orders, Discrete Math. 137 (1995), 303-313.
N. Sauer and J. Spencer, Edge disjoint placement of graphs, J. Combin. Theory Ser. B 25 (1978), 295-302.
N. Sauer and I. Zaguia, The order of the rationals has an orthogonal order with the same order type, Order 28 (2011), no. 3, 377-385.
M. Wozniak, Packing of graphs and permutations -a survey, Discrete Math. 276 (2004), 379-391.
A. Zak, Near packing of graphs, Electron. J. Combin. 20 (2013), no. 2, #P36.
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.