DOCSLIB.ORG

Counting in Sparse Graphs

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Counting in Sparse Graphs Peter´ Csikvari´ Counting in Sparse Graphs Lecture note Contents 1 Statistical Physical Models 1 1.1 Combinatorics and statistical physics . .1 1.2 Factor graphs . .5 1.3 Tutte polynomial . .8 2 Extremal Regular Graphs 12 2.1 Extremal regular graphs . 12 2.2 The case of Kd;d ................................ 13 2.3 The case of Kd+1 ............................... 16 2.4 The case of Td ................................. 18 3 Sidorenko's conjecture 20 3.1 Sidorenko's conjecture . 20 3.2 Graphs with Sidorenko's property . 21 3.3 Sidorenko's conjecture with fixed target graph . 23 4 Graph Polynomials 27 4.1 Adjacency matrix and eigenvalues . 27 4.2 Matching polynomial . 35 4.3 Chromatic polynomial . 43 5 Empirical Measures 46 5.1 Benjamini{Schram convergence and convergence of measures . 47 5.2 Moments and homomorphism numbers . 49 5.3 Kesten-McKay measure . 54 5.4 McKay's theorem . 55 6 Correlation Inequalities 60 6.1 Gibbs-measures . 60 6.2 Positive correlation . 60 i 7 Graph Covers 70 7.1 Two ideas, one method . 70 7.2 Bipartite double cover . 71 7.3 Independent sets, matchings and 2-covers . 73 7.4 Ruozzi's theorem . 75 7.5 Large girth phenomena . 76 7.6 Matchings . 76 8 Bethe Approximation 79 8.1 Covers of factor graphs . 83 9 Stable Polynomials 86 9.1 Multivariate polynomials . 86 10 Entropy 98 10.1 Information and counting . 98 10.2 Basic properties of entropy . 98 10.3 Matchings: Br´egman'stheorem . 102 10.4 Homomorphisms . 104 Bibliography 107 ii 1. Statistical Physical Models 1.1 Combinatorics and statistical physics The counting problems studied in this book are directly related to statistical physical models. These models in turn provide a large amount of motivation for the investigated phenomenons. Here we survey these models and their relationships with each other. 1.1.1 Monomer-dimer and dimer model For a graph G let M(G) be the set of all matchings. Recall that a matching M of G is simply a set of edges such that now two edges in the set intersect each other. When this set has k edges, then we say that it is a k-matching or alternatively, the matching M is of size k. For a λ > 0 we can associate a probability space on M(G) by choosing a random matching M as follows: λjMj (M = M) = ; P M(G; λ) where M(G; λ) is the normalizing constant: X M(G; λ) = λjMj: M2M(G) This model is the monomer-dimer model. The name has the following origin. In statistical physics the vertices of the graph represent particles, and edges represent some sort of interaction between certain pair of particles. A dimer is then simply a pair of particles where the interaction is active. Supposing that one particle can be in active with at most one other particles we get that dimers form a matchings. The uncovered vertices are then called monomers. We say that M(G; λ) is the partition function of the monomer-dimer model. In mathematics it is called the matching generating function. Let mk(G) denote the number of k-matchings. Then X k M(G; λ) = mk(G)λ : k Note that the sum runs from k = 0 as the empty set is a matching by definition. Naturally, once we introduced a probability distribution we can ask various natural question like 1 what EjMj is. It is not hard to see that X jMjλjMj λM 0(G; λ) jMj = = : E M(G; λ) M(G; λ) M2M(G) If G has 2n vertices then we call an n-matching a perfect matching as it covers all vertices. The dimer model is the model where we consider a uniform distribution on the perfect matchings. Clearly, a dimer model is a monomer-dimer model without monomers. The number of perfect matchings is pm(G). With our previous notation pm(G) = mn(G). 1.1.2 Hard-core model For a graph G let I(G) be the set of all independent sets. Recall that an independent set is a subset I of the vertices such that no two element of I is adjacent in G. Here the vertices of G represent possible places for particles that repulse each other so no two adjacent vertex can be occupied by particles. For a λ > 0 we can associate a probability space on I(G) by choosing a random matching I as follows: λjIj (I = I) = ; P I(G; λ) where I(G; λ) is the normalizing constant: X I(G; λ) = λjMj: I2I(G) Then I(G; λ) is the partition function of the hard-core model. In mathematics it is called the independence polynomial of the graph G. Let ik(G) denote the number of independent sets of size k. Then n X k I(G; λ) = ik(G)λ : k=0 Note that the sum runs from k = 0 as the empty set is an independent set by definition. Similar to the case of the matchings we have X jIjλjIj λI0(G; λ) jIj = = : E I(G; λ) I(G; λ) I2I(G) 1.1.3 Ising-model In the case of the Ising-model the vertices of the graph G represent particles. These particles have a spin which can be up (+1) or down (−1). Two adjacent particles have an interaction eβ if they have the same spin, and e−β if they have different spin. Suppose also that there is an external magnetic field that breaks the symmetry between +1 and 2 −1. This defines a probability distribution on the possible configurations as follows: for a random spin configuration S: 0 1 1 X X (S = σ) = exp βσ(u)σ(v) + B σ(u) ; P Z @ A (u;v)2E(G) u2V (G) where Z is the normalizing constant: 0 1 X X X ZIs(G; B; β) = exp @ βσ(u)σ(v) + B σ(u)A : σ:V (G)→{−1;1g (u;v)2E(G) u2V (G) Similarly to the previous cases, Z is the partition function of the Ising-model. When β > 0 we say that it is a ferromagnetic Ising-model, and when β < 0 then we say that it is an antiferromagnetic model. It turns out that the model behaves very differently in the two regimes even if we only consider extremal graph theoretic questions. 1.1.4 Potts-model and random-cluster model Potts-model is a generalization of the Ising-model. Again the vertices of the graph G represent particles, but this time their spin or state can be one of q different states, i. e., σ : V (G) ! [q]. Two adjacent particles have an interaction eβ if they are in the same state, and no interaction otherwise. This defines a probability distribution on the possible configurations as follows: for a random configuration S: let 1(statement) = 1 if the statement is true and 0 otherwise, then 0 1 1 X (S = σ) = exp β1(σ(u) = σ(v)) ; P Z @ A (u;v)2E(G) where Z is the normalizing constant: 0 1 X X ZPo(G; q; β) = exp @ βI(σ(u) = σ(v))A : σ:V (G)![q] (u;v)2E(G) Similarly to the previous cases, Z is the partition function of the Potts-model. In the case when β is large then the system prefers configurations where the particles are in the same state. When β is a large negative number then the system prefers configuration where adjacent vertices are in different states. In the limiting case β = −∞ when eβ = 0, the partition function Z counts the proper colorings of G with q colors. Formally, a map f : V ! f1; 2; : : : ; qg is a proper coloring if for all edges (x; y) 2 E we have f(x) 6= f(y). For a positive integer q let ch(G; q) denote the number of proper colorings of G with q colors. Then it turns out that ch(G; q) is a polynomial in q, and so we can study this 3 quantity even at non-integer or negative q's. This polynomial is called the chromatic polynomial [27]. It is a monic polynomial of degree v(G). Potts-model is very strongly related to the so-called random cluster model. In this model, the probability distribution is on the subsets of the edge set E(G) and for a random subset F we have 1 (F = F ) = qk(F )wjF j; P Z where k(F ) is the number of connected components of the graph G0 = (V (G);F ). Here q is non-negative and w ≥ −1, but not necessarily integers, and Z is the normalizing constant X k(F ) jF j ZRC(G; q; w) = q w : F ⊆E(G) Lemma 1.1.1. Let q be a positive integer, and eβ = 1 + w. Then ZPo(G; q; β) = ZRC(G; q; w): Proof. Clearly, 0 1 X X ZPo(G; q; β) = exp @ βI(σ(u) = σ(v))A σ:V (G)![q] (u;v)2E(G) X Y = (1 + (eβ − 1)I(σ(u) = σ(v))) σ:V (G)![q] (u;v)2E(G) X Y = (1 + wI(σ(u) = σ(v))) σ:V (G)![q] (u;v)2E(G) X X Y = wjAj I(σ(u) = σ(v)) σ:V (G)![q] A⊆E(G) (u;v)2A 0 1 X jAj X Y = w @ I(σ(u) = σ(v))A A⊆E(G) σ:V (G)![q] (u;v)2A X = wjAjqk(A) A⊆E(G) = ZRC(G; q; w): 1.1.5 Homomorphisms and partition functions It turns out that many things in the previous sections have a common generalization.
Load more

Recommended publications
  • Automorphisms of the Double Cover of a Circulant Graph of Valency at Most 7
    AUTOMORPHISMS OF THE DOUBLE COVER OF A CIRCULANT GRAPH OF VALENCY AT MOST 7 ADEMIR HUJDUROVIC,´ ¯DOR¯DE MITROVIC,´ AND DAVE WITTE MORRIS Abstract. A graph X is said to be unstable if the direct product X × K2 (also called the canonical double cover of X) has automorphisms that do not come from automorphisms of its factors X and K2. It is nontrivially unstable if it is unstable, connected, and non-bipartite, and no two distinct vertices of X have exactly the same neighbors. We find all of the nontrivially unstable circulant graphs of valency at most 7. (They come in several infinite families.) We also show that the instability of each of these graphs is explained by theorems of Steve Wilson. This is best possible, because there is a nontrivially unstable circulant graph of valency 8 that does not satisfy the hypotheses of any of Wilson's four instability theorems for circulant graphs. 1. Introduction Let X be a circulant graph. (All graphs in this paper are finite, simple, and undirected.) Definition 1.1 ([16]). The canonical bipartite double cover of X is the bipartite graph BX with V (BX) = V (X) 0; 1 , where × f g (v; 0) is adjacent to (w; 1) in BX v is adjacent to w in X: () Letting S2 be the symmetric group on the 2-element set 0; 1 , it is clear f g that the direct product Aut X S2 is a subgroup of Aut BX. We are interested in cases where this subgroup× is proper: Definition 1.2 ([12, p.
    [Show full text]
  • Graph Operations and Upper Bounds on Graph Homomorphism Counts
    Graph Operations and Upper Bounds on Graph Homomorphism Counts Luke Sernau March 9, 2017 Abstract We construct a family of countexamples to a conjecture of Galvin [5], which stated that for any n-vertex, d-regular graph G and any graph H (possibly with loops), n n d d hom(G, H) ≤ max hom(Kd,d,H) 2 , hom(Kd+1,H) +1 , n o where hom(G, H) is the number of homomorphisms from G to H. By exploiting properties of the graph tensor product and graph exponentiation, we also find new infinite families of H for which the bound stated above on hom(G, H) holds for all n-vertex, d-regular G. In particular we show that if HWR is the complete looped path on three vertices, also known as the Widom-Rowlinson graph, then n d hom(G, HWR) ≤ hom(Kd+1,HWR) +1 for all n-vertex, d-regular G. This verifies a conjecture of Galvin. arXiv:1510.01833v3 [math.CO] 8 Mar 2017 1 Introduction Graph homomorphisms are an important concept in many areas of graph theory. A graph homomorphism is simply an adjacency-preserving map be- tween a graph G and a graph H. That is, for given graphs G and H, a function φ : V (G) → V (H) is said to be a homomorphism from G to H if for every edge uv ∈ E(G), we have φ(u)φ(v) ∈ E(H) (Here, as throughout, all graphs are simple, meaning without multi-edges, but they are permitted 1 to have loops).
    [Show full text]
  • Lombardi Drawings of Graphs 1 Introduction
    Lombardi Drawings of Graphs Christian A. Duncan1, David Eppstein2, Michael T. Goodrich2, Stephen G. Kobourov3, and Martin Nollenburg¨ 2 1Department of Computer Science, Louisiana Tech. Univ., Ruston, Louisiana, USA 2Department of Computer Science, University of California, Irvine, California, USA 3Department of Computer Science, University of Arizona, Tucson, Arizona, USA Abstract. We introduce the notion of Lombardi graph drawings, named after the American abstract artist Mark Lombardi. In these drawings, edges are represented as circular arcs rather than as line segments or polylines, and the vertices have perfect angular resolution: the edges are equally spaced around each vertex. We describe algorithms for finding Lombardi drawings of regular graphs, graphs of bounded degeneracy, and certain families of planar graphs. 1 Introduction The American artist Mark Lombardi [24] was famous for his drawings of social net- works representing conspiracy theories. Lombardi used curved arcs to represent edges, leading to a strong aesthetic quality and high readability. Inspired by this work, we intro- duce the notion of a Lombardi drawing of a graph, in which edges are drawn as circular arcs with perfect angular resolution: consecutive edges are evenly spaced around each vertex. While not all vertices have perfect angular resolution in Lombardi’s work, the even spacing of edges around vertices is clearly one of his aesthetic criteria; see Fig. 1. Traditional graph drawing methods rarely guarantee perfect angular resolution, but poor edge distribution can nevertheless lead to unreadable drawings. Additionally, while some tools provide options to draw edges as curves, most rely on straight-line edges, and it is known that maintaining good angular resolution can result in exponential draw- ing area for straight-line drawings of planar graphs [17,25].
    [Show full text]
  • The Operations Invariant Properties on Graphs Yanzhong Hu, Gang
    International Conference on Education Technology and Information System (ICETIS 2013) The Operations Invariant Properties on Graphs Yanzhong Hu, Gang Cheng School of Computer Science, Hubei University of Technology, Wuhan, 430068, China [email protected], [email protected] Keywords：Invariant property; Hamilton cycle; Cartesian product; Tensor product Abstract. To determine whether or not a given graph has a Hamilton cycle (or is a planar graph), defined the operations invariant properties on graphs, and discussed the various forms of the invariant properties under the circumstance of Cartesian product graph operation and Tensor product graph operation. The main conclusions include: The Hamiltonicity of graph is invariant concerning the Cartesian product, and the non-planarity of the graph is invariant concerning the tensor product. Therefore, when we applied these principles into practice, we testified that Hamilton cycle does exist in hypercube and the Desargues graph is a non-planarity graph. INTRODUCTION The Planarity, Eulerian feature, Hamiltonicity, bipartite property, spectrum, and so on, is often overlooked for a given graph. The traditional research method adopts the idea of direct proof. In recent years, indirect proof method is put forward, (Fang Xie & Yanzhong Hu, 2010) proves non- planarity of the Petersen graph, by use the non-planarity of K3,3, i.e., it induces the properties of the graph G with the properties of the graph H, here H is a sub-graph of G. However, when it comes to induce the other properties, the result is contrary to what we expect. For example, Fig. 1(a) is a Hamiltonian graph which is a sub-graph of Fig.
    [Show full text]
  • Not Every Bipartite Double Cover Is Canonical
    Volume 82 BULLETIN of the February 2018 INSTITUTE of COMBINATORICS and its APPLICATIONS Editors-in-Chief: Marco Buratti, Donald Kreher, Tran van Trung Boca Raton, FL, U.S.A. ISSN1182-1278 BULLETIN OF THE ICA Volume 82 (2018), Pages 51{55 Not every bipartite double cover is canonical Tomaˇz Pisanski University of Primorska, FAMNIT, Koper, Slovenia and IMFM, Ljubljana, Slovenia. [email protected]. Abstract: It is explained why the term bipartite double cover should not be used to designate canonical double cover alias Kronecker cover of graphs. Keywords: Kronecker cover, canonical double cover, bipartite double cover, covering graphs. Math. Subj. Class. (2010): 05C76, 05C10. It is not uncommon to use different terminology or notation for the same mathematical concept. There are several reasons for such a phenomenon. Authors independently discover the same object and have to name it. It is• quite natural that they choose different names. Sometimes the same concept appears in different mathematical schools or in• different disciplines. By using particular terminology in a given context makes understanding of such a concept much easier. Sometimes original terminology is not well-chosen, not intuitive and it is difficult• to relate the name of the object to its meaning. A name that is more appropriate for a given concept is preferred. One would expect terminology to be as simple as possible, and as easy to connect it to the concept as possible. However, it should not be too simple. Received: 8 October 2018 51 Accepted: 21 January 2018 In other words it should not introduce ambiguity. Unfortunately, the term bipartite double cover that has been used lately in several places to replace an older term canonical double cover, also known as the Kronecker cover, [1,4], is ambiguous.
    [Show full text]
  • Nearly Tight Approximability Results for Minimum Biclique Cover and Partition
    Nearly Tight Approximability Results for Minimum Biclique Cover and Partition Parinya Chalermsook1, Sandy Heydrich1;3, Eugenia Holm2, and Andreas Karrenbauer1∗ 1 Max Planck Institute for Informatics, Saarbr¨ucken, Germany 2 Dept. for Computer and Information Science, University of Konstanz, Germany 3 Saarbr¨ucken Graduate School of Computer Science {andreas.karrenbauer,parinya.chalermsook,sandy.heydrich}@mpi-inf.mpg.de [email protected] Abstract. In this paper, we consider the minimum biclique cover and minimum biclique partition problems on bipartite graphs. In the min- imum biclique cover problem, we are given an input bipartite graph G = (V; E), and our goal is to compute the minimum number of complete bipartite subgraphs that cover all edges of G. This problem, besides its correspondence to a well-studied notion of bipartite dimension in graph theory, has applications in many other research areas such as artificial intelligence, computer security, automata theory, and biology. Since it is NP-hard, past research has focused on approximation algorithms, fixed parameter tractability, and special graph classes that admit polynomial time exact algorithms. For the minimum biclique partition problem, we are interested in a biclique cover that covers each edge exactly once. We revisit the problems from approximation algorithms' perspectives and give nearly tight lower and upper bound results. We first show that both problems are NP-hard to approximate to within a factor of n1−" (where n is the number of vertices in the input graph). Using a stronger complexity assumption, the hardness becomes Ω~(n), where Ω~(·) hides lower order terms. Then we show that approximation factors of the form n=(log n)γ for some γ > 0 can be obtained.
    [Show full text]
  • Enlarging Properties of Graphs
    Enlarging Properties of Graphs Alan Geoffrey Boshier PhD Thesis, Royal Holloway & Bedford New College, University of London. gv^A y COLLEGE UBRARY O ProQuest Number: 10096264 All rights reserved INFORMATION TO ALL USERS The quality of this reproduction is dependent upon the quality of the copy submitted. In the unlikely event that the author did not send a complete manuscript and there are missing pages, these will be noted. Also, if material had to be removed, a note will indicate the deletion. uest. ProQuest 10096264 Published by ProQuest LLC(2016). Copyright of the Dissertation is held by the Author. All rights reserved. This work is protected against unauthorized copying under Title 17, United States Code. Microform Edition © ProQuest LLC. ProQuest LLC 789 East Eisenhower Parkway P.O. Box 1346 Ann Arbor, Ml 48106-1346 Abstract The subjects of this Thesis are the enlarging and magnifying properties of graphs. Upper bounds for the isoperimetric number i{G) of a graph G are determined with respect to such elementary graph properties as order, valency, and the number of three and four- cycles. The relationship between z(G) and the genus of G is studied in detail, and a class of graphs called finite element graphs is shown never to supply enlarging families. The magnifying properties of Hamiltonian cubic graphs are investigated, and a class of graphs known as shift graphs is defined. These are shown never to form enlarging families, using a technical lemma derived from Klawe’s Theorem on non-expanding families of graphs. The same lemma is used, in conjunction with some elementary character theory, to prove that several important classes of Cayley graphs do not form enlarging families, and to derive a lower bound on the subdominant eigenvalue of a vertex-transitive graph.
    [Show full text]
  • Bidirected Graph from Wikipedia, the Free Encyclopedia Contents
    Bidirected graph From Wikipedia, the free encyclopedia Contents 1 Bidirected graph 1 1.1 Other meanings ............................................ 1 1.2 See also ................................................ 2 1.3 References ............................................... 2 2 Bipartite double cover 3 2.1 Construction .............................................. 3 2.2 Examples ............................................... 3 2.3 Matrix interpretation ......................................... 4 2.4 Properties ............................................... 4 2.5 Other double covers .......................................... 4 2.6 See also ................................................ 5 2.7 Notes ................................................. 5 2.8 References ............................................... 5 2.9 External links ............................................. 6 3 Complex question 7 3.1 Implication by question ........................................ 7 3.2 Complex question fallacy ....................................... 7 3.2.1 Similar questions and fallacies ................................ 8 3.3 Notes ................................................. 8 4 Directed graph 10 4.1 Basic terminology ........................................... 11 4.2 Indegree and outdegree ........................................ 11 4.3 Degree sequence ............................................ 12 4.4 Digraph connectivity .......................................... 12 4.5 Classes of digraphs .........................................
    [Show full text]
  • Totally Silver Graphs
    Totally Silver Graphs M. Ghebleha, E. S. Mahmoodianb aDepartment of Mathematics, Faculty of Science, Kuwait University, State of Kuwait bDepartment of Mathematical Sciences, Sharif University of Technology, Tehran, Iran Abstract A totally silver coloring of a graph G is a k{coloring of G such that for every vertex v 2 V (G), each color appears exactly once on N[v], the closed neighborhood of v.A totally silver graph is a graph which admits a totally silver coloring. Totally silver coloring are directly related to other areas of graph theory such as distance coloring and domination. In this work, we present several constructive characterizations of totally silver graphs and bipartite totally silver graphs. We give several infinite families of totally silver graphs. We also give cubic totally silver graphs of girth up to 10. Keywords: Graph coloring, distance coloring, silver coloring, domination. 1. Introduction All graphs in this paper are finite and simple. A totally silver coloring of a graph G is a k{coloring of G such that for every vertex v 2 V (G), each color appears exactly once on N[v], the closed neighborhood of v.A totally silver graph is a graph which admits a totally silver coloring. It is immediate from this definition that every graph admitting a totally silver coloring with k colors is (k − 1){regular. Totally silver colorings are introduced in [4]. The term totally silver is inspired by an International Mathematical Olympiad problem on silver matrices [6]. Totally silver colorings appear, under the name perfect colorings, in the study of file seg- mentations in a network in [1].
    [Show full text]
  • An Analysis of the Properties of Various Interconnection Networks K
    Volume 5, No. 4, April 2014 (Special Issue) ISSN No. 0976-5697 International Journal of Advanced Research in Computer Science REVIEW ARTICAL Available Online at www.ijarcs.info An Analysis of the Properties of Various Interconnection Networks K. Karthik Sudarson Jena Dept .of CSE Dept. of IT BVRIT, Narsapur GITAM University [email protected] [email protected] T. Venu Gopal Dept. of CSE JNTUHCEJ, Kondagattu [email protected] Abstract: In this paper, different types of interconnection networks are investigated and some of their properties are analyzed to summarize the differences in their network cost. The various properties of the interconnection networks such as connectivity, routing algorithm, diameter and broadcasting technology are investigated. This analysis gives a framework for the construction of more efficient interconnection networks in future. Key words: Interconnection Networks, Network cost, Routing Algorithms, Diameter, Broad casting Technology Network scales being typically used for comparative I. INTRODUCTION evaluation of an interconnection network due to the said characteristic include network cost [4-10] defined as degree x In parallel computing, to achieve parallelism various diameter of an interconnection network. By virtue of its merit techniques can be employed. One technique of achieving of easily providing a communication network system required parallelism is using MIMD (Multiple Instruction Multiple in applications of all kinds. Hypercube is node-symmetric and Data stream). Machines using MIMD have a number of edge-symmetric, has a simple routing algorithm with maximal processor that functions asynchronously and independently. fault tolerance and a simple reflexive system, and also has a At any time, different processors may be executing different merit that it may be readily embedded with the proposed instructions on different pieces of data.
    [Show full text]
  • Entropy-Based Proofs of Combinatorial Results on Bipartite Graphs
    Entropy-Based Proofs of Combinatorial Results on Bipartite Graphs Igal Sason Andrew and Erna Viterbi Faculty of Electrical and Computer Engineering Technion-Israel Institute of Technology, Haifa 3200003, Israel E-mail: [email protected] Abstract—This work considers new entropy-based proofs of e.g., [7] and [22, Problems 3.25–3.37]). Moore’s bound some known, or otherwise refined, combinatorial bounds for provides an upper bound on the girth of irregular graphs bipartite graphs. These include upper bounds on the number as a function of their number of vertices and their average of the independent sets, lower bounds on the minimal number of colors in constrained edge coloring, and lower bounds on degree [1]. An entropy-based proof of Moore’s bound for the number of walks of a given length in bipartite graphs. The graphs (and bipartite graphs) was introduced in [2]. proofs of these combinatorial results rely on basic properties of 4) Additional combinatorial properties of bipartite graphs: In the Shannon entropy. [12], a new conditional entropy inequality was derived, followed by a study of two of its combinatorial applications I. INTRODUCTION to bipartite graphs. These include a derivation of a lower bound on the minimal number of colors in (rich) graph The Shannon entropy serves as a powerful tool in various coloring, and a derivation of a lower bound on the biclique combinatorial and graph-theoretic applications (see, e.g., the cover number of bipartite graphs. tutorials in [8] and [20], as well as [5], [6], [17], [18], [19]). 5) Although not directly related to bipartite graphs, a variant Combinatorial properties of bipartite graphs are of great of Shearer’s lemma for the relative entropy was introduced interest in graph theory, combinatorics, modern coding theory, in [16] (see Corollary 7 and Remark 9 there), and also and information theory.
    [Show full text]
  • Imprimitive Cometric Association Schemes: Constructions and Analysis
    Imprimitive cometric association schemes: constructions and analysis William J. Martin Department of Mathematical Sciences and Department of Computer Science Worcester Polytechnic Institute Worcester, Massachusetts [email protected] Mikhail Muzychuk Department of Computer Science and Mathematics Netanya Academic College Netanya 42365 Israel [email protected] Jason Williford Department of Mathematical Sciences Worcester Polytechnic Institute Worcester, Massachusetts [email protected] June 8, 2006 Dedicated to the memory of Dom de Caen, 1956–2002. Abstract Dualizing the “extended bipartite double” construction for distance-regular graphs, we construct a new family of cometric (or Q-polynomial) association schemes with four associate classes based on linked systems of symmetric designs. The analysis of these new schemes naturally leads to structural questions concerning imprimitive cometric association schemes, some of which we answer with others being left as open prob- lems. In particular, we prove that any Q-antipodal association scheme is dismantlable: the configuration induced on any subset of the equivalence classes in the Q-antipodal imprimitivity system is again a cometric association scheme. Further examples are explored. 1 1 A census of cometric association schemes Very few examples are known of association schemes that are cometric but not metric. Much effort has been devoted to the study and classification of Q-polynomial distance- regular graphs, i.e., association schemes that are both metric and cometric, since the most important families
    [Show full text]