DOCSLIB.ORG

Spectra of Graphs

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Spectra of Graphs Spectra of graphs Andries E. Brouwer Willem H. Haemers 2 Contents 1 Graph spectrum 11 1.1 Matricesassociatedtoagraph . 11 1.2 Thespectrumofagraph ...................... 12 1.2.1 Characteristicpolynomial . 13 1.3 Thespectrumofanundirectedgraph . 13 1.3.1 Regulargraphs ........................ 13 1.3.2 Complements ......................... 14 1.3.3 Walks ............................. 14 1.3.4 Diameter ........................... 14 1.3.5 Spanningtrees ........................ 15 1.3.6 Bipartitegraphs ....................... 16 1.3.7 Connectedness ........................ 16 1.4 Spectrumofsomegraphs . 17 1.4.1 Thecompletegraph . 17 1.4.2 Thecompletebipartitegraph . 17 1.4.3 Thecycle ........................... 18 1.4.4 Thepath ........................... 18 1.4.5 Linegraphs .......................... 18 1.4.6 Cartesianproducts . 19 1.4.7 Kronecker products and bipartite double. 19 1.4.8 Strongproducts ....................... 19 1.4.9 Cayleygraphs......................... 20 1.5 Decompositions............................ 20 1.5.1 Decomposing K10 intoPetersengraphs . 20 1.5.2 Decomposing Kn into complete bipartite graphs . 20 1.6 Automorphisms ........................... 21 1.7 Algebraicconnectivity . 22 1.8 Cospectralgraphs .......................... 22 1.8.1 The4-cube .......................... 23 1.8.2 Seidelswitching. 23 1.8.3 Godsil-McKayswitching. 24 1.8.4 Reconstruction ........................ 24 1.9 Verysmallgraphs .......................... 24 1.10 Exercises ............................... 25 3 4 CONTENTS 2 Linear algebra 29 2.1 Simultaneousdiagonalization . 29 2.2 Perron-FrobeniusTheory . 29 2.3 Equitablepartitions . 32 2.3.1 Equitable and almost equitable partitions of graphs . 32 2.4 TheRayleighquotient. 33 2.5 Interlacing .............................. 34 2.6 Schur’sinequality .......................... 35 2.7 Schurcomplements.......................... 36 2.8 TheCourant-Weylinequalities . 36 2.9 Grammatrices ............................ 37 2.10 Diagonallydominantmatrices . 38 2.10.1 Gerˇsgorincircles . 38 2.11 Projections .............................. 39 2.12 Exercises ............................... 39 3 Eigenvalues and eigenvectors of graphs 41 3.1 Thelargesteigenvalue . 41 3.1.1 Graphswithlargesteigenvalueatmost2 . 42 3.1.2 Subdividinganedge . 43 3.1.3 TheKelmansoperation . 44 3.1.4 Spectral radius of a graph with a given number of edges . 44 3.2 Interlacing .............................. 45 3.3 Regulargraphs............................ 46 3.4 Bipartitegraphs ........................... 46 3.5 Cliquesandcocliques ........................ 47 3.5.1 Usingweightedadjacencymatrices . 47 3.6 Chromaticnumber.......................... 48 3.6.1 Usingweightedadjacencymatrices . 50 3.6.2 Rankandchromaticnumber . 50 3.7 Shannoncapacity .......................... 50 3.7.1 Lov´asz’ ϑ-function ...................... 51 3.7.2 The Haemers bound on the Shannon capacity . 53 3.8 Classificationofintegralcubicgraphs . 53 3.9 ThelargestLaplaceeigenvalue . 57 3.10 Laplaceeigenvaluesanddegrees . 58 3.11 TheGrone-MerrisConjecture. 60 3.11.1 Thresholdgraphs. 60 3.11.2 ProofoftheGrone-MerrisConjecture . 60 3.12 TheLaplacianforhypergraphs . 63 3.13 Applicationsofeigenvectors. 65 3.13.1 Ranking............................ 65 3.13.2 GooglePagerank. 65 3.13.3 Cutting ............................ 66 3.13.4 Graphdrawing ........................ 67 3.13.5 Clustering........................... 67 3.13.6 GraphIsomorphism . 68 3.13.7 Searchinganeigenspace . 69 3.14 Starsandstarcomplements. 69 CONTENTS 5 3.15 Exercises ............................... 70 4 The second largest eigenvalue 73 4.1 Boundsforthesecondlargesteigenvalue. 73 4.2 Largeregularsubgraphsareconnected. 74 4.3 Randomness ............................. 74 4.4 Randomwalks ............................ 75 4.5 Expansion............................... 76 4.6 ToughnessandHamiltonicity . 77 4.6.1 ThePetersengraphisnotHamiltonian . 77 4.7 Diameterbound ........................... 78 4.8 Separation .............................. 78 4.8.1 Bandwidth .......................... 80 4.8.2 Perfectmatchings . 80 4.9 Blockdesigns............................. 82 4.10 Polarities ............................... 84 4.11 Exercises ............................... 85 5 Trees 87 5.1 Characteristicpolynomialsoftrees . 87 5.2 Eigenvectorsandmultiplicities . 89 5.3 Signpatternsofeigenvectorsofgraphs. 90 5.4 Signpatternsofeigenvectorsoftrees. 91 5.5 Thespectralcenterofatree . 92 5.6 Integraltrees ............................. 93 5.7 Exercises ............................... 94 6 Groups and graphs 95 6.1 Γ(G,H,S) .............................. 95 6.2 Spectrum ............................... 95 6.3 NonabelianCayleygraphs. 96 6.4 Covers................................. 97 6.5 Cayleysumgraphs.......................... 99 6.5.1 (3,6)-fullerenes . 99 6.6 Exercises ............................... 100 7 Topology 101 7.1 Embeddings ............................. 101 7.2 Minors ................................ 101 7.3 TheColindeVerdi`ereinvariant. 102 7.4 The Van der Holst-Laurent-Schrijver invariant . 103 7.5 Spectralradiusofgraphsonasurface . 104 7.6 Exercises ............................... 104 8 Euclidean representations 105 8.1 Examples ............................... 105 8.2 Euclideanrepresentation . 105 8.3 Rootlattices ............................. 106 8.4 Cameron-Goethals-Seidel-Shult . 111 8.5 Furtherapplications . 112 6 CONTENTS 8.6 Exercises ............................... 112 9 Strongly regular graphs 113 9.1 Stronglyregulargraphs . 113 9.1.1 Simpleexamples . 113 9.1.2 ThePaleygraphs. 114 9.1.3 Adjacencymatrix . 115 9.1.4 Imprimitivegraphs. 115 9.1.5 Parameters .......................... 115 9.1.6 The half case and cyclic strongly regular graphs . 116 9.1.7 Strongly regular graphs without triangles . 116 9.1.8 Furtherparameterrestrictions . 117 9.1.9 Strongly regular graphs from permutation groups . 118 9.1.10 Strongly regular graphs from quasisymmetric designs . 119 9.1.11 Symmetric 2-designs from strongly regular graphs . 119 9.1.12 Latinsquaregraphs . 119 9.1.13 PartialGeometries . 121 9.2 Strongly regular graphs with eigenvalue 2............ 121 − 9.3 Connectivity ............................. 122 9.4 Cocliquesandcolorings . 124 9.4.1 Cliques ............................ 125 9.5 Automorphisms ........................... 126 9.6 Generalizedquadrangles. 126 9.6.1 Parameters .......................... 126 9.6.2 Constructions of generalized quadrangles . 127 9.6.3 Strongly regular graphs from generalized quadrangles . 128 9.6.4 Generalized quadrangles with lines of size 3 . 128 9.7 The(81,20,1,6)stronglyregulargraph . 129 9.7.1 Descriptions. .. 129 9.7.2 Uniqueness .......................... 130 9.7.3 Independence and chromatic numbers . 131 9.7.4 Secondsubconstituent . 132 9.7.5 Strongly regular graphs with λ = 1 and g = k ....... 133 9.8 Strongly regular graphs and 2-weight codes . 133 9.8.1 Codes,graphsandprojectivesets. 133 9.8.2 The correspondence between linear codes and subsets of a projectivespace. 133 9.8.3 The correspondence between projective two-weight codes, subsets of a projective space with two intersection num- bers, and affine strongly regular graphs . 134 9.8.4 Duality for affine strongly regular graphs . 136 9.8.5 Cyclotomy .......................... 137 9.9 Table ................................. 139 9.10 Exercises ............................... 144 CONTENTS 7 10 Regular two-graphs 147 10.1 Stronggraphs ............................ 147 10.2 Two-graphs.............................. 148 10.3 Regulartwo-graphs . 149 10.3.1 Relatedstronglyregulargraphs . 151 10.3.2 The regular two-graph on 276 points . 152 10.3.3 Coherentsubsets . 152 10.3.4 Completelyregulartwo-graphs . 152 10.4 Conferencematrices . 153 10.5 Hadamardmatrices . 154 10.5.1 Constructions. 155 10.6 Equiangularlines. 156 10.6.1 Equiangular lines in Rd and two-graphs . 156 10.6.2 Bounds on equiangular sets of lines in Rd or Cd . 157 10.6.3 Bounds on sets of lines with few angles and sets of vectors withfewdistances . 159 10.7 Exercise................................ 160 11 Association schemes 161 11.1 Definition............................... 161 11.2 TheBose-Mesneralgebra . 162 11.3 TheLinearProgrammingBound . 164 11.3.1 Equality............................ 165 11.3.2 TheCode-CliqueTheorem . 165 11.3.3 StrengthenedLPbounds . 165 11.4 TheKreinparameters . 166 11.5 Automorphisms ........................... 167 11.5.1 TheMooregraphon3250vertices . 168 11.6 P - and Q-polynomialassociationschemes . 168 11.7 Exercises ............................... 170 12 Distance-regular graphs 173 12.1 Parameters .............................. 173 12.2 Spectrum ............................... 173 12.3 Primitivity .............................. 174 12.4 Examples ............................... 174 12.4.1 Hamminggraphs . 174 12.4.2 Johnsongraphs. 175 12.4.3 Grassmanngraphs . 175 12.4.4 VanDam-Koolengraphs. 175 12.5 Bannai-Itoconjecture . 176 12.6 Connectedness ............................ 176 12.7 Growth ................................ 176 12.8 Degreeofeigenvalues . 176 12.9 Mooregraphsandgeneralizedpolygons . 177 12.10Euclideanrepresentations . 178 12.10.1Borsuk’sConjecture . 178 12.11Extremality.............................. 179 12.12Exercises ............................... 180 8 CONTENTS 13 p-ranks 183 13.1 Reduction mod p ........................... 183 13.2 Theminimalpolynomial . 184 13.3 Bounds for the p-rank........................ 184 13.4 Interesting primes p ......................... 185 13.5 Adding a multiple of J ....................... 185
Load more

Recommended publications
  • Graphs with Few Eigenvalues
    Graphs with few eigenvalues An interplay between combinatorics and algebra Graphs with few eigenvalues An interplay between combinatorics and algebra Proefschrift ter verkrijging van de graad van doctor aan de Katholieke Universiteit Brabant, op gezag van de rector magnificus, prof. dr. L.F.W. de Klerk, in het openbaar te verdedigen ten overstaan van een door het college van dekanen aangewezen commissie in de aula van de Universiteit op vrijdag 4 oktober 1996 om 14.15 uur door Edwin Robert van Dam geboren op 27 augustus 1968 te Valkenswaard Promotor: Prof. dr. S.H. Tijs Copromotor: Dr. ir. W.H. Haemers Ter nagedachtenis van Opa Vogel Acknowledgements During the past four years I have had the pleasure to work on this thesis under the supervision of Willem Haemers. His support and guidance have always been stimulating, and I have found Willem always available. So thanks Willem, I had a great time. I also wish to thank Stef Tijs, for being my promoter, and the other members of the thesis committee: Andries Brouwer, Giel Paardekooper, Lex Schrijver and Ted Spence. Special thanks go to Ted Spence for the enjoyable cooperation in the past years, and for always providing me with interesting combinatorial data. Furthermore I would like to thank Jaap Seidel for inspiring me, D.G. Higman for his inspiring manuscript on rank four association schemes, and all other people who showed interest in my work. During the past years I attended several graduate courses with great pleasure, and I thank the organizers and lecturers of LNMB and EIDMA for those.
    [Show full text]
  • Avoiding Rainbow Induced Subgraphs in Vertex-Colorings
    Avoiding rainbow induced subgraphs in vertex-colorings Maria Axenovich and Ryan Martin∗ Department of Mathematics, Iowa State University, Ames, IA 50011 [email protected], [email protected] Submitted: Feb 10, 2007; Accepted: Jan 4, 2008 Mathematics Subject Classification: 05C15, 05C55 Abstract For a fixed graph H on k vertices, and a graph G on at least k vertices, we write G −→ H if in any vertex-coloring of G with k colors, there is an induced subgraph isomorphic to H whose vertices have distinct colors. In other words, if G −→ H then a totally multicolored induced copy of H is unavoidable in any vertex-coloring of G with k colors. In this paper, we show that, with a few notable exceptions, for any graph H on k vertices and for any graph G which is not isomorphic to H, G 6−→ H. We explicitly describe all exceptional cases. This determines the induced vertex- anti-Ramsey number for all graphs and shows that totally multicolored induced subgraphs are, in most cases, easily avoidable. 1 Introduction Let G =(V, E) be a graph. Let c : V (G) → [k] be a vertex-coloring of G. We say that G is monochromatic under c if all vertices have the same color and we say that G is rainbow or totally multicolored under c if all vertices of G have distinct colors. The existence of a arXiv:1605.06172v1 [math.CO] 19 May 2016 graph forcing an induced monochromatic subgraph isomorphic to H is well known. The following bounds are due to Brown and R¨odl: Theorem 1 (Vertex-Induced Graph Ramsey Theorem [6]) For all graphs H, and all positive integers t there exists a graph Rt(H) such that if the vertices of Rt(H) are colored with t colors, then there is an induced subgraph of Rt(H) isomorphic to H which is monochromatic.
    [Show full text]
  • An Elementary Proof of the Spectral Radius Formula for Matrices
    AN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES JOEL A. TROPP Abstract. We present an elementary proof that the spectral ra- dius of a matrix A may be obtained using the formula 1 ρ(A) = lim kAnk =n; n!1 where k · k represents any matrix norm. 1. Introduction It is a well-known fact from the theory of Banach algebras that the spectral radius of any element A is given by the formula ρ(A) = lim kAnk1=n: (1.1) n!1 For a matrix, the spectrum is just the collection of eigenvalues, so this formula yields a technique for estimating for the top eigenvalue. The proof of Equation 1.1 is beautiful but advanced. See, for exam- ple, Rudin's treatment in his Functional Analysis. It turns out that elementary techniques suffice to develop the formula for matrices. 2. Preliminaries For completeness, we shall briefly introduce the major concepts re- quired in the proof. It is expected that the reader is already familiar with these ideas. 2.1. Norms. A norm is a mapping k · k from a vector space X into the nonnegative real numbers R+ which has three properties: (1) kxk = 0 if and only if x = 0; (2) kαxk = jαj kxk for any scalar α and vector x; and (3) kx + yk ≤ kxk + kyk for any vectors x and y. The most fundamental example of a norm is the Euclidean norm k·k2 which corresponds to the standard topology on Rn. It is defined by 2 2 2 kxk2 = k(x1; x2; : : : ; xn)k2 = x1 + x2 + · · · + xn: Date: 30 November 2001.
    [Show full text]
  • Parametrizations of K-Nonnegative Matrices
    Parametrizations of k-Nonnegative Matrices Anna Brosowsky, Neeraja Kulkarni, Alex Mason, Joe Suk, Ewin Tang∗ October 2, 2017 Abstract Totally nonnegative (positive) matrices are matrices whose minors are all nonnegative (positive). We generalize the notion of total nonnegativity, as follows. A k-nonnegative (resp. k-positive) matrix has all minors of size k or less nonnegative (resp. positive). We give a generating set for the semigroup of k-nonnegative matrices, as well as relations for certain special cases, i.e. the k = n − 1 and k = n − 2 unitriangular cases. In the above two cases, we find that the set of k-nonnegative matrices can be partitioned into cells, analogous to the Bruhat cells of totally nonnegative matrices, based on their factorizations into generators. We will show that these cells, like the Bruhat cells, are homeomorphic to open balls, and we prove some results about the topological structure of the closure of these cells, and in fact, in the latter case, the cells form a Bruhat-like CW complex. We also give a family of minimal k-positivity tests which form sub-cluster algebras of the total positivity test cluster algebra. We describe ways to jump between these tests, and give an alternate description of some tests as double wiring diagrams. 1 Introduction A totally nonnegative (respectively totally positive) matrix is a matrix whose minors are all nonnegative (respectively positive). Total positivity and nonnegativity are well-studied phenomena and arise in areas such as planar networks, combinatorics, dynamics, statistics and probability. The study of total positivity and total nonnegativity admit many varied applications, some of which are explored in “Totally Nonnegative Matrices” by Fallat and Johnson [5].
    [Show full text]
  • Three Conjectures in Extremal Spectral Graph Theory
    Three conjectures in extremal spectral graph theory Michael Tait and Josh Tobin June 6, 2016 Abstract We prove three conjectures regarding the maximization of spectral invariants over certain families of graphs. Our most difficult result is that the join of P2 and Pn−2 is the unique graph of maximum spectral radius over all planar graphs. This was conjectured by Boots and Royle in 1991 and independently by Cao and Vince in 1993. Similarly, we prove a conjecture of Cvetkovi´cand Rowlinson from 1990 stating that the unique outerplanar graph of maximum spectral radius is the join of a vertex and Pn−1. Finally, we prove a conjecture of Aouchiche et al from 2008 stating that a pineapple graph is the unique connected graph maximizing the spectral radius minus the average degree. To prove our theorems, we use the leading eigenvector of a purported extremal graph to deduce structural properties about that graph. Using this setup, we give short proofs of several old results: Mantel's Theorem, Stanley's edge bound and extensions, the K}ovari-S´os-Tur´anTheorem applied to ex (n; K2;t), and a partial solution to an old problem of Erd}oson making a triangle-free graph bipartite. 1 Introduction Questions in extremal graph theory ask to maximize or minimize a graph invariant over a fixed family of graphs. Perhaps the most well-studied problems in this area are Tur´an-type problems, which ask to maximize the number of edges in a graph which does not contain fixed forbidden subgraphs. Over a century old, a quintessential example of this kind of result is Mantel's theorem, which states that Kdn=2e;bn=2c is the unique graph maximizing the number of edges over all triangle-free graphs.
    [Show full text]
  • Manifold Learning
    MANIFOLD LEARNING Kavé Salamatian- LISTIC Learning Machine Learning: develop algorithms to automatically extract ”patterns” or ”regularities” from data (generalization) Typical tasks Clustering: Find groups of similar points Dimensionality reduction: Project points in a lower dimensional space while preserving structure Semi-supervised: Given labelled and unlabelled points, build a labelling function Supervised: Given labelled points, build a labelling function All these tasks are not well-defined Clustering Identify the two groups Dimensionality Reduction 4096 Objects in R ? But only 3 parameters: 2 angles and 1 for illumination. They span a 3- dimensional sub-manifold of R4096! Semi-Supervised Learning Assign labels to black points Supervised learning Build a function that predicts the label of all points in the space Formal definitions Clustering: Given build a function Dimensionality reduction: Given build a function Semi-supervised: Given and with m << n, build a function Supervised: Given , build Geometric learning Consider and exploit the geometric structure of the data Clustering: two ”close” points should be in the same cluster Dimensionality reduction: ”closeness” should be preserved Semi-supervised/supervised: two ”close” points should have the same label Examples: k-means clustering, k-nearest neighbors. Manifold ? A manifold is a topological space that is locally Euclidian Around every point, there is a neighborhood that is topologically isomorph to unit ball Regularization Adopt a functional viewpoint
    [Show full text]
  • Crystals and Total Positivity on Orientable Surfaces 3
    CRYSTALS AND TOTAL POSITIVITY ON ORIENTABLE SURFACES THOMAS LAM AND PAVLO PYLYAVSKYY Abstract. We develop a combinatorial model of networks on orientable surfaces, and study weight and homology generating functions of paths and cycles in these networks. Network transformations preserving these generating functions are investigated. We describe in terms of our model the crystal structure and R-matrix of the affine geometric crystal of products of symmetric and dual symmetric powers of type A. Local realizations of the R-matrix and crystal actions are used to construct a double affine geometric crystal on a torus, generalizing the commutation result of Kajiwara-Noumi- Yamada [KNY] and an observation of Berenstein-Kazhdan [BK07b]. We show that our model on a cylinder gives a decomposition and parametrization of the totally nonnegative part of the rational unipotent loop group of GLn. Contents 1. Introduction 3 1.1. Networks on orientable surfaces 3 1.2. Factorizations and parametrizations of totally positive matrices 4 1.3. Crystals and networks 5 1.4. Measurements and moves 6 1.5. Symmetric functions and loop symmetric functions 7 1.6. Comparison of examples 7 Part 1. Boundary measurements on oriented surfaces 9 2. Networks and measurements 9 2.1. Oriented networks on surfaces 9 2.2. Polygon representation of oriented surfaces 9 2.3. Highway paths and cycles 10 arXiv:1008.1949v1 [math.CO] 11 Aug 2010 2.4. Boundary and cycle measurements 10 2.5. Torus with one vertex 11 2.6. Flows and intersection products in homology 12 2.7. Polynomiality 14 2.8. Rationality 15 2.9.
    [Show full text]
  • The Veldkamp Space of GQ(2,4) Metod Saniga, Richard Green, Peter Levay, Petr Pracna, Peter Vrana
    The Veldkamp Space of GQ(2,4) Metod Saniga, Richard Green, Peter Levay, Petr Pracna, Peter Vrana To cite this version: Metod Saniga, Richard Green, Peter Levay, Petr Pracna, Peter Vrana. The Veldkamp Space of GQ(2,4). International Journal of Geometric Methods in Modern Physics, World Scientific Publishing, 2010, pp.1133-1145. 10.1142/S0219887810004762. hal-00365656v2 HAL Id: hal-00365656 https://hal.archives-ouvertes.fr/hal-00365656v2 Submitted on 6 Jul 2009 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. The Veldkamp Space of GQ(2,4) M. Saniga,1 R. M. Green,2 P. L´evay,3 P. Pracna4 and P. Vrana3 1Astronomical Institute, Slovak Academy of Sciences SK-05960 Tatransk´aLomnica, Slovak Republic ([email protected]) 2Department of Mathematics, University of Colorado Campus Box 395, Boulder CO 80309-0395, U. S. A. ([email protected]) 3Department of Theoretical Physics, Institute of Physics Budapest University of Technology and Economics, H-1521 Budapest, Hungary ([email protected] and [email protected]) and 4J. Heyrovsk´yInstitute of Physical Chemistry, v.v.i., Academy of Sciences of the Czech Republic, Dolejˇskova 3, CZ-182 23 Prague 8, Czech Republic ([email protected]) (6 July 2009) Abstract It is shown that the Veldkamp space of the unique generalized quadrangle GQ(2,4) is isomor- phic to PG(5,2).
    [Show full text]
  • Discrete Mathematics Lecture Notes Incomplete Preliminary Version
    Discrete Mathematics Lecture Notes Incomplete Preliminary Version Instructor: L´aszl´oBabai Last revision: June 22, 2003 Last update: April 2, 2021 Copyright c 2003, 2021 by L´aszl´oBabai All rights reserved. Contents 1 Logic 1 1.1 Quantifier notation . 1 1.2 Problems . 1 2 Asymptotic Notation 5 2.1 Limit of sequence . 6 2.2 Asymptotic Equality and Inequality . 6 2.3 Little-oh notation . 9 2.4 Big-Oh, Omega, Theta notation (O, Ω, Θ) . 9 2.5 Prime Numbers . 11 2.6 Partitions . 11 2.7 Problems . 12 3 Convex Functions and Jensen's Inequality 15 4 Basic Number Theory 19 4.1 Introductory Problems: g.c.d., congruences, multiplicative inverse, Chinese Re- mainder Theorem, Fermat's Little Theorem . 19 4.2 Gcd, congruences . 24 4.3 Arithmetic Functions . 26 4.4 Prime Numbers . 30 4.5 Quadratic Residues . 33 4.6 Lattices and diophantine approximation . 34 iii iv CONTENTS 5 Counting 37 5.1 Binomial coefficients . 37 5.2 Recurrences, generating functions . 40 6 Graphs and Digraphs 43 6.1 Graph Theory Terminology . 43 6.1.1 Planarity . 52 6.1.2 Ramsey Theory . 56 6.2 Digraph Terminology . 57 6.2.1 Paradoxical tournaments, quadratic residues . 61 7 Finite Probability Spaces 63 7.1 Finite probability space, events . 63 7.2 Conditional probability, probability of causes . 65 7.3 Independence, positive and negative correlation of a pair of events . 67 7.4 Independence of multiple events . 68 7.5 Random graphs: The Erd}os{R´enyi model . 71 7.6 Asymptotic evaluation of sequences .
    [Show full text]
  • Some Topics Concerning Graphs, Signed Graphs and Matroids
    SOME TOPICS CONCERNING GRAPHS, SIGNED GRAPHS AND MATROIDS DISSERTATION Presented in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in the Graduate School of the Ohio State University By Vaidyanathan Sivaraman, M.S. Graduate Program in Mathematics The Ohio State University 2012 Dissertation Committee: Prof. Neil Robertson, Advisor Prof. Akos´ Seress Prof. Matthew Kahle ABSTRACT We discuss well-quasi-ordering in graphs and signed graphs, giving two short proofs of the bounded case of S. B. Rao's conjecture. We give a characterization of graphs whose bicircular matroids are signed-graphic, thus generalizing a theorem of Matthews from the 1970s. We prove a recent conjecture of Zaslavsky on the equality of frus- tration number and frustration index in a certain class of signed graphs. We prove that there are exactly seven signed Heawood graphs, up to switching isomorphism. We present a computational approach to an interesting conjecture of D. J. A. Welsh on the number of bases of matroids. We then move on to study the frame matroids of signed graphs, giving explicit signed-graphic representations of certain families of matroids. We also discuss the cycle, bicircular and even-cycle matroid of a graph and characterize matroids arising as two different such structures. We study graphs in which any two vertices have the same number of common neighbors, giving a quick proof of Shrikhande's theorem. We provide a solution to a problem of E. W. Dijkstra. Also, we discuss the flexibility of graphs on the projective plane. We conclude by men- tioning partial progress towards characterizing signed graphs whose frame matroids are transversal, and some miscellaneous results.
    [Show full text]
  • Octonion Multiplication and Heawood's
    CONFLUENTES MATHEMATICI Bruno SÉVENNEC Octonion multiplication and Heawood’s map Tome 5, no 2 (2013), p. 71-76. <http://cml.cedram.org/item?id=CML_2013__5_2_71_0> © Les auteurs et Confluentes Mathematici, 2013. Tous droits réservés. L’accès aux articles de la revue « Confluentes Mathematici » (http://cml.cedram.org/), implique l’accord avec les condi- tions générales d’utilisation (http://cml.cedram.org/legal/). Toute reproduction en tout ou partie de cet article sous quelque forme que ce soit pour tout usage autre que l’utilisation á fin strictement personnelle du copiste est constitutive d’une infrac- tion pénale. Toute copie ou impression de ce fichier doit contenir la présente mention de copyright. cedram Article mis en ligne dans le cadre du Centre de diffusion des revues académiques de mathématiques http://www.cedram.org/ Confluentes Math. 5, 2 (2013) 71-76 OCTONION MULTIPLICATION AND HEAWOOD’S MAP BRUNO SÉVENNEC Abstract. In this note, the octonion multiplication table is recovered from a regular tesse- lation of the equilateral two timensional torus by seven hexagons, also known as Heawood’s map. Almost any article or book dealing with Cayley-Graves algebra O of octonions (to be recalled shortly) has a picture like the following Figure 0.1 representing the so-called ‘Fano plane’, which will be denoted by Π, together with some cyclic ordering on each of its ‘lines’. The Fano plane is a set of seven points, in which seven three-point subsets called ‘lines’ are specified, such that any two points are contained in a unique line, and any two lines intersect in a unique point, giving a so-called (combinatorial) projective plane [8,7].
    [Show full text]
  • Interlacing Families I: Bipartite Ramanujan Graphs of All Degrees
    Annals of Mathematics 182 (2015), 307{325 Interlacing families I: Bipartite Ramanujan graphs of all degrees By Adam W. Marcus, Daniel A. Spielman, and Nikhil Srivastava Abstract We prove that there exist infinite families of regular bipartite Ramanujan graphs of every degree bigger than 2. We do this by proving a variant of a conjecture of Bilu and Linial about the existence of good 2-lifts of every graph. We also establish the existence of infinite families of \irregular Ramanujan" graphs, whose eigenvalues are bounded by the spectral radius of their universal cover. Such families were conjectured to exist by Linial and others. In particular, we prove the existence of infinite families of (c; d)-biregular bipartite graphs with all nontrivial eigenvalues bounded by p p c − 1 + d − 1 for all c; d ≥ 3. Our proof exploits a new technique for controlling the eigenvalues of certain random matrices, which we call the \method of interlacing polynomials." 1. Introduction Ramanujan graphs have been the focus of substantial study in Theoret- ical Computer Science and Mathematics. They are graphs whose nontrivial adjacency matrix eigenvalues are as small as possible. Previous constructions of Ramanujan graphs have been sporadic, only producing infinite families of Ramanujan graphs of certain special degrees. In this paper, we prove a variant of a conjecture of Bilu and Linial [4] and use it to realize an approach they suggested for constructing bipartite Ramanujan graphs of every degree. Our main technical contribution is a novel existence argument. The con- jecture of Bilu and Linial requires us to prove that every graph has a signed adjacency matrix with all of its eigenvalues in a small range.
    [Show full text]