46 research outputs found

    Interpolation theorem for a continuous function on orientations of a simple graph

    Get PDF
    summary:Let GG be a simple graph. A function ff from the set of orientations of GG to the set of non-negative integers is called a continuous function on orientations of GG if, for any two orientations O1O_1 and O2O_2 of GG, f(O1)f(O2)1|f(O_1)-f(O_2)|\le 1 whenever O1O_1 and O2O_2 differ in the orientation of exactly one edge of GG. We show that any continuous function on orientations of a simple graph GG has the interpolation property as follows: If there are two orientations O1O_1 and O2O_2 of GG with f(O1)=pf(O_1)=p and f(O2)=qf(O_2)=q, where p<qp<q, then for any integer kk such that p<k<qp<k<q, there are at least mm orientations OO of GG satisfying f(O)=kf(O) = k, where mm equals the number of edges of GG. It follows that some useful invariants of digraphs including the connectivity, the arc-connectivity and the absorption number, etc., have the above interpolation property on the set of all orientations of GG

    Interpolation theorem for a continuous function on orientations of a simple graph

    Get PDF
    Let G be a simple graph. A function f from the set of orientations of G to the set of Iron-negative integers is called a continuous function on orientations of G if, for any two orientations O-1 and O-2 of G, \f(O-1) - f(O-2)\ less than or equal to 1 whenever O-1 and O-2 differ in the orientation of exactly one edge of G. We show that any continuous function on orientations of a simple graph G has the interpolation property as follows: If there are two orientations O-1 and O-2 of G with f(O-1) = p and f(O-2) = q, where p < q, then for any integer k such that p < k < q, there are at least m orientations O of G satisfying f(O) = k, where m equals the number of edges of G. It follows that some useful invariants of digraphs including the connectivity, the arc-connectivity and the absorption number, etc., have the above interpolation property on the set of all orientations of G

    Distinguishing graphs by their left and right homomorphism profiles

    Get PDF
    We introduce a new property of graphs called ‘q-state Potts unique-ness’ and relate it to chromatic and Tutte uniqueness, and also to ‘chromatic–flow uniqueness’, recently studied by Duan, Wu and Yu. We establish for which edge-weighted graphs H homomor-phism functions from multigraphs G to H are specializations of the Tutte polynomial of G, in particular answering a question of Freed-man, Lovász and Schrijver. We also determine for which edge-weighted graphs H homomorphism functions from multigraphs G to H are specializations of the ‘edge elimination polynomial’ of Averbouch, Godlin and Makowsky and the ‘induced subgraph poly-nomial’ of Tittmann, Averbouch and Makowsky. Unifying the study of these and related problems is the notion of the left and right homomorphism profiles of a graph.Ministerio de Educación y Ciencia MTM2008-05866-C03-01Junta de Andalucía FQM- 0164Junta de Andalucía P06-FQM-0164

    Protecting a Graph with Mobile Guards

    Full text link
    Mobile guards on the vertices of a graph are used to defend it against attacks on either its vertices or its edges. Various models for this problem have been proposed. In this survey we describe a number of these models with particular attention to the case when the attack sequence is infinitely long and the guards must induce some particular configuration before each attack, such as a dominating set or a vertex cover. Results from the literature concerning the number of guards needed to successfully defend a graph in each of these problems are surveyed.Comment: 29 pages, two figures, surve

    On The Growth Of Permutation Classes

    Get PDF
    We study aspects of the enumeration of permutation classes, sets of permutations closed downwards under the subpermutation order. First, we consider monotone grid classes of permutations. We present procedures for calculating the generating function of any class whose matrix has dimensions m × 1 for some m, and of acyclic and unicyclic classes of gridded permutations. We show that almost all large permutations in a grid class have the same shape, and determine this limit shape. We prove that the growth rate of a grid class is given by the square of the spectral radius of an associated graph and deduce some facts relating to the set of grid class growth rates. In the process, we establish a new result concerning tours on graphs. We also prove a similar result relating the growth rate of a geometric grid class to the matching polynomial of a graph, and determine the effect of edge subdivision on the matching polynomial. We characterise the growth rates of geometric grid classes in terms of the spectral radii of trees. We then investigate the set of growth rates of permutation classes and establish a new upper bound on the value above which every real number is the growth rate of some permutation class. In the process, we prove new results concerning expansions of real numbers in non-integer bases in which the digits are drawn from sets of allowed values. Finally, we introduce a new enumeration technique, based on associating a graph with each permutation, and determine the generating functions for some previously unenumerated classes. We conclude by using this approach to provide an improved lower bound on the growth rate of the class of permutations avoiding the pattern 1324. In the process, we prove that, asymptotically, patterns in Łukasiewicz paths exhibit a concentrated Gaussian distribution

    Determinantal Sieving

    Full text link
    We introduce determinantal sieving, a new, remarkably powerful tool in the toolbox of algebraic FPT algorithms. Given a polynomial P(X)P(X) on a set of variables X={x1,,xn}X=\{x_1,\ldots,x_n\} and a linear matroid M=(X,I)M=(X,\mathcal{I}) of rank kk, both over a field F\mathbb{F} of characteristic 2, in 2k2^k evaluations we can sieve for those terms in the monomial expansion of PP which are multilinear and whose support is a basis for MM. Alternatively, using 2k2^k evaluations of PP we can sieve for those monomials whose odd support spans MM. Applying this framework, we improve on a range of algebraic FPT algorithms, such as: 1. Solving qq-Matroid Intersection in time O(2(q2)k)O^*(2^{(q-2)k}) and qq-Matroid Parity in time O(2qk)O^*(2^{qk}), improving on O(4qk)O^*(4^{qk}) (Brand and Pratt, ICALP 2021) 2. TT-Cycle, Colourful (s,t)(s,t)-Path, Colourful (S,T)(S,T)-Linkage in undirected graphs, and the more general Rank kk (S,T)(S,T)-Linkage problem, all in O(2k)O^*(2^k) time, improving on O(2k+S)O^*(2^{k+|S|}) respectively O(2S+O(k2log(k+F)))O^*(2^{|S|+O(k^2 \log(k+|\mathbb{F}|))}) (Fomin et al., SODA 2023) 3. Many instances of the Diverse X paradigm, finding a collection of rr solutions to a problem with a minimum mutual distance of dd in time O(2r(r1)d/2)O^*(2^{r(r-1)d/2}), improving solutions for kk-Distinct Branchings from time 2O(klogk)2^{O(k \log k)} to O(2k)O^*(2^k) (Bang-Jensen et al., ESA 2021), and for Diverse Perfect Matchings from O(22O(rd))O^*(2^{2^{O(rd)}}) to O(2r2d/2)O^*(2^{r^2d/2}) (Fomin et al., STACS 2021) All matroids are assumed to be represented over a field of characteristic 2. Over general fields, we achieve similar results at the cost of using exponential space by working over the exterior algebra. For a class of arithmetic circuits we call strongly monotone, this is even achieved without any loss of running time. However, the odd support sieving result appears to be specific to working over characteristic 2

    Contributions at the Interface Between Algebra and Graph Theory

    Get PDF
    In this thesis, we make some contributions at the interface between algebra and graph theory. In Chapter 1, we give an overview of the topics and also the definitions and preliminaries. In Chapter 2, we estimate the number of possible types degree patterns of k-lacunary polynomials of degree t < p which split completely modulo p. The result is based on a rather unusual combination of two techniques: a bound on the number of zeros of lacunary polynomials and a bound on the so-called domination number of a graph. In Chapter 3, we deal with the determinant of bipartite graphs. The nullity of a graph G is the multiplicity of 0 in the spectrum of G. Nullity of a (molecular) graph (e.g., a bipartite graph corresponding to an alternant hydrocarbon) has important applications in quantum chemistry and Huckel molecular orbital (HMO) theory. A famous problem, posed by Collatz and Sinogowitz in 1957, asks to characterize all graphs with positive nullity. Clearly, examining the determinant of a graph is a way to attack this problem. In this Chapter, we show that the determinant of a bipartite graph with at least two perfect matchings and with all cycle lengths divisible by four, is zero. In Chapter 4, we first introduce an application of spectral graph theory in proving trigonometric identities. This is a very simple double counting argument that gives very short proofs for some of these identities (and perhaps the only existed proof in some cases!). In the rest of Chapter 4, using some properties of the well-known Chebyshev polynomials, we prove some theorems that allow us to evaluate the number of spanning trees in join of graphs, Cartesian product of graphs, and nearly regular graphs. In the last section of Chapter 4, we obtain the number of spanning trees in an (r,s)-semiregular graph and its line graph. Note that the same results, as in the last section, were proved by I. Sato using zeta functions. But our proofs are much shorter based on some well-known facts from spectral graph theory. Besides, we do not use zeta functions in our arguments. In Chapter 5, we present the conclusion and also some possible projects

    29th International Symposium on Algorithms and Computation: ISAAC 2018, December 16-19, 2018, Jiaoxi, Yilan, Taiwan

    Get PDF
    corecore