# COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH. 1. Introduction

Size: px
Start display at page:

## Transcription

1 COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the Higman-Sims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact it is strongly regular, where any two adjacent nodes have 0 common neighbors, and any two non-adjacent nodes have 6 common neighbors. We offer multiple constructions of the graph, based on the unique S(3, 6, 22) Steiner system (obtained by extending the projective plain Π 4 ), the Leech lattice, and maximal cocliques in the (50, 7, 0, 1) strongly regular Hoffman-Singleton graph. Along the way, we compute the automorphism group of the Higman-Sims graph, proving that it is a double cover of a simple group, the so-called Higman-Sims group. 2. Construction and Uniqueness In this section we construct the Higman-Sims graph G HS and prove that it is the unique (100, 22, 0, 6) strongly regular graph. Both the construction and the proof of uniqueness rely heavily on the S(3, 6, 22) Steiner system, D 22, which is known to be unique for those parameters. We require no knowledge about D 22 other than the fact that it is the unique 3-(22, 6, 1) design, and we will make frequent use of its intersection triangle shown in Figure 1, where entry ν i,j for 0 j i 6 counts the number of blocks of D 22 that intersect a given set of i points of a block exactly in a prescribed subset of size j. Let D 22 = (X, B). Define a graph G HS on vertex set V (G HS ) = { } X B of size = 100, with edges defined as follows: The point connects to each x X; for x X and B B, edge (x, B) is in the graph if and only if x B; and for B 1, B 2 B, edge (B 1, B 2 ) is in the graph if and only if B 1 B 2 =. Theorem 1. The graph G HS defined above is strongly regular with parameters (100, 22, 0, 6). Proof. In what follows, x and x i are always elements of X, and B or B i are elements of B. To see that G HS is regular of degree 22, note that connects to the 22 elements of X; each x X connects to and the 21 blocks containing it; and each block B B connects to its 6 points and the 16 blocks disjoint from it. Date: Thursday, May 6,

2 2 ZACHARY ABEL Figure 1: The intersection triange for the S(3, 6, 22) Steiner system D 22. Entry ν i,j counts the number of blocks of D 22 that intersect a given set of i points from a block exactly in a given subset of size j. The property λ = 0 is equivalent to G HS having no triangles. There can be no triangle of the form x, B 1, B 2 because if x B 1 and x B 2 then B 1 and B 2 are not disjoint. The only other possibility is a triangle of blocks B 1, B 2, B 3, so let us show that no such triangle exists. Suppose that B 1 and B 2 are disjoint blocks. How many blocks B intersect B 1 and B 2 (necessarily in two points each)? Such a block B may be specified by choosing the two points {x 1, x 2 } = B 1 B and a point x 3 B 2 B, and every block B comes from two such choices (we could replace x 3 with the other point of B B 2 ), so there are ( 6 2) 6/2 = 45 blocks intersecting both B 1 and B 2. It follows that there are = 0 blocks disjoint from B 1 and B 2, as needed. Now we verify µ = 6. A pair of non-adjacent edges has the form (, B), (x 1, x 2 ), (x, B) with x / B, or (B 1, B 2 ) with B 1 B 2. In the first case, and B have six common neighbors, namely the elements of B. In the (x 1, x 2 ) case, both points are connected to and are contained in exactly 5 blocks of D 22. Next suppose x / B. Any block B B intersects B in 0 or 2 points, and for each pair of points x 1, x 2 B there is a unique block containing x, x 1, x 2, so there are exactly ( 6 2) blocks containing x that intersect B. So there are = 6 blocks containing x that are disjoint from B, i.e. nodes x, B V (G HS ) have exactly 6 common neighbors. Finally, suppose blocks B 1, B 2 are not disjoint, and therefore intersect in 2 points, thus accounting for two common neighbors of B 1 and B 2. With a similar count as in the previous paragraph, we find that there are exactly 4 blocks disjoint from both B 1 and B 2, showing that B 1 and B 2 indeed have 6 common neighbors. This completes the proof of strong regularity. We may also use the uniqueness of D 22 to show the uniqueness of the G HS graph. This uniqueness was first proved by Gewirtz [3], but the proof below follows a simplified argument by Brouwer [1]. Theorem 2. The Higman-Sims graph G HS is the unique (100, 22, 0, 6) strongly regular graph. Proof. Suppose G is some (100, 22, 0, 6) graph. Pick any vertex V (G), and let Y be the set of 22 neighbors of, with C the set of 77 non-neighbors of. Any node C C has µ = 6 neighbors in common with, so let N(C) denote this set of six points in Y that are neighbors of C. The crux of the proof is showing that these 77 6-tuples N(C) form a 3-(22, 6, 1) design on Y.

3 COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH 3 First, if two point C 1, C 2 C had N(C 1 ) N(C 2 ) 3, then these three points of Y together with C 1, C 2, would form a complete bipartite induced subgraph K = K 3,3. But the variance trick allows us to prove that no such subgraph exists. Indeed, for each 0 i 6 let n i denote the number of nodes outside of K adjacent to exactly i nodes of K. The number of nodes in G \ K is i n i = 94. Each node of K connects to 19 nodes outside of K, so the number of edges joining K and G \ K is 6 19 = i in i. Finally, for each pair of distinct nodes {k 1, k 2 } in K, if they are not adjacent then they have 3 common neighbors in K and µ 3 = 3 common neighbors outside K, whereas if they are adjacent then they have no common neighbors. So the number of unordered paths (k 1, v, k 2 ) in G with k 1 k 2 K and v G \ K is 6 3 = i ( i 2) ni. It follows that i (i 1)(i 2)n i = 2, which is impossible because (i 1)(i 2)n i 0 for each i. So no induced K 3,3 subgraphs exist in G, meaning any two blocks N(C 1 ) and N(C 2 ) have at most 2 points in common. We have just shown that each triple of points in Y is contained in at most one block N(C), so exactly ( 6 3) 77 = 1540 distinct triples in Y appear in some block. But there are exactly ( 22 3 ) = 1540 triples of points in Y, so each appears exactly once. This exactly means that the sets N(C) indeed form a S(3, 6, 22) Steiner system on Y, which must be the unique D 22 design. If two points C 1, C 2 C are adjacent in G then they have no common neighbors, so N(C 1 ) N(C 2 ) =. It follows that the 16 neighbors of C 1 in C must correspond exactly to the 16 blocks in the S(3, 6, 22) Steiner system disjoint from N(C 1 ). So G has exactly the same edges as G HS above, as desired. Note. The graph whose 77 vertices are the blocks of D 22 where two blocks are adjacent if and only if they are disjoint equivalently, the subgraph of G HS induced on the vertices B forms a strongly regular graph with parameters (77, 16, 0, 4). Brouwer [1] uses this embedding into the Higman-Sims graph, combined with methods similar to those above, to show the uniqueness of the 77-node strongly regular graph with the above parameters. 3. Automorphisms of G HS and the Higman-Sims group Let HS = Aut(G HS ) be the automorphism group of graph G HS. An automorphism f Aut(G HS ) fixing must send X to itself and B to itself while preserving incidence, i.e. must be an automorphism of D 22. So the point stabilizer HS is Aut(D 22 ) = M 22, which contains the Mathieu group M 22 with index 2 as the subgroup of even permutations of the 99 elements X B. The group HS, thought of as a permutation group on its 100 nodes, therefore contains odd permutations, so we may define HS HS as the index-2 subgroup of even permutations, whose point stabilizer HS is M 22. In this section we will compute the orders of HS and HS and show that the group HS is simple. Lemma 3. The group HS acts transitively on the vertices of G HS.

4 4 ZACHARY ABEL Proof. Recall that M 22 acts three-transitively on the points of D 22, so HS acts transitively on X G HS and acts transitively on B G HS (because three points uniquely determine their block). Let x X be any point, and let Y and C be the set of neighbors and non-neighbors of x, respectively. By the uniqueness of the Higman-Sims graph, the neighbor sets {y Y (C, y) E(G HS )} for each C C form a D 22 on Y. Thus, the point stabilizer HS y is another copy of M 22, which therefore acts transitively on Y. But Y contains as well as points from X and B, so all 100 nodes of G HS are indeed in the same orbit under HS. Corollary 4. The group HS has order 100 M 22 = = , and HS has order 2 HS = = Proof. This follows directly from the Orbit-Stabilizer theorem. Corollary 5. The group HS acts primitively on the vertices of G HS. Proof. If G HS were transitive but imprimitive, then its action would fix some partition V (G HS ) = P 1 P k for 2 < k < 100. Because G HS acts transitively, all P i have the same size d, which is some divisor of 100. Suppose without loss of generality that P 1. Because neither nor divide 100, we may find two vertices v, w V (G HS ) \ { } such that v P 1, w / P 1, and either both v and w are in X or both are in B. We know that HS = M 22 acts transitively on both X and B, so there is some automorphism of G HS fixing and sending v to w. This automorphism does not preserve the partition P 1 P k, contrary to assumption. Armed with the primitivity of the action of HS on V (G HS ), as well as the fact that the point stabilizers of HS namely M 22 are simple, we may prove the simplicity of HS itself: Theorem 6. The group HS is simple. Proof. Suppose {1} N HS is a normal subgroup. If N were not transitive, then the orbits under the action of N would form a partition of V (G HS ) which is fixed by the action of HS, contrary to the fact that HS acts primitively. So N is transitive. The intersection N HS is normal in HS = M22, so by simplicity of M 22 this intersection is either M 22 or {1}. In the former case, N = 100 N = HS, which cannot happen because N is a strict subgroup. So N HS = {1}, and N has order 100. By Sylow s theorems, if n 5 is the number of 5-Sylow subgroups of N then both n 5 (100/5 2 ) = 4 and n 5 1 mod 5 hold, so n 5 = 1. This Sylow subgroup S N is thus the unique subgroup of N of order 25, and because conjugation by elements in HS fixes N it also sends S to a 25-element subgroup of N, namely S. So S is normal in HS. But as shown above, any nontrivial normal subgroup of HS has order exactly 100, which is a contradiction. This proves that N does not exist, and HS is simple.

5 COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH 5 4. Embedding in the Leech Lattice The Leech lattice Λ 24 is an even, unimodular, 24-dimensional lattice with minimal norm 1 4, which may be constructed from the extended binary Golay code G as follows. For convenience, scale the standard Euclidean inner product by 1 8 so that we may write the vectors of Λ 24 with integer coordinates. The Leech lattice vectors have the form (x 1,..., x 24 ) where each x i is an integer such that x x 24 4x 1 4x 24 mod 8 and furthermore, for each residue m mod 4, the binary word with a 1 in the i th slot exactly when x i m mod 4 must be in the extended Golay code G. Recall that the automorphism group of the Golay code is M 24. Both M 24 and the Golay code itself act on Λ 24 by signed permutations: M 24 naturally permutes the 24 coordinates, and a word w G negates the coordinates where w has a 1. This group 2 12 M 24 is not the full automorphism group Aut(Λ 24 ), but it is useful for computing within the lattice. For example, we may use it to easily enumerate the minimal (norm 4) vectors of Λ 24. Suppose first that each x i is even. If the Golay codeword of 2 mod 4 elements is the zero codeword then all entries are divisible by 4 and their sum is divisible by 8. So there must be at least two nonzero coordinates, and the smallest possibility has shape (±4, ±4, 0 22 ), with squared norm 4. Any permutation and sign choice is contained in Λ 24, and these comprise a single orbit under the action of 2 12 M 24. This orbit contains exactly ( 24 2 ) 2 2 = 1104 vectors of this shape. If the Golay codeword is nonzero, then there are at least 8 entries that are 2 mod 4, and the smallest possibility has the form (±2 8, 0 16 ) (and squared norm 4), where the eight ±2s form a block of the 5-(24, 8, 1) design and the number of minus signs is even. There are = such vectors, again forming a single orbit under 2 12 M 24. Finally, if each of the coordinates is odd then not all of them can be ±1, so the smallest possibility has 23 entries of ±1 and one ±3. It may be seen that all vectors in Λ 24 of this form arise from the orbit of the norm 4 vector ( 3, 1 23 ) under 2 12 M 24, and that this orbit has size = There are thus = vectors in Λ 24 of norm 4. Let us show that the Higman-Sims graph may be found within Λ 24. Choose two vectors v, w Λ 24 of norm 3 such that v w has norm 2, for example v = (5, 1, 1 22 ), w = (1, 5, 1 22 ). It is known that the group Aut(Λ 24 ) acts transitively on ordered pairs (v, w) with this property (see [5, 5.4]), so there is no loss of generality in choosing v, w as above. How many vectors t Λ 24 of norm 2 have 1 In this section, norm always means squared length.

6 6 ZACHARY ABEL inner product 3 with both v and w? Equivalently, t v and t w must both have norm 2. Let T denote the set of such vectors. The copy of M 22 M 24 that stabilizes the first two coordinates acts on T, because such permutations do not affect distances to v and w. Because we know exactly what the norm-2 vectors of Λ 24 look like, we may easily enumerate T. If x is in the 2 12 M 24 orbit of (±4, ±4, 0 22 ) then it must be the single vector = (4, 4, 0 22 ). If x has shape ( 3, 1 23 ) (up to sign) then it must have a 3 in the last 22 coordinates with all other coordinates +1, so these vectors are in the M 22 orbit of (1, 1, 3, 1 21 ) of size 22; call this orbit X. Finally, if it is in the 2 12 M 24 orbit of (2 8, 0 16 ) then it must be in the M 22 orbit of (2, 2, 2 6, 0 16 ), of which there are 77 members; call this orbit B. So T has exactly = 100 vectors. Form the graph on T by creating edge (t 1, t 2 ) exactly when t 1 and t 2 have inner product 1, i.e. t 1 t 2 has norm 2. This graph is isomorphic to the Higman-Sims graph. For proof, identify a vector in the X orbit with the coordinate containing 3, and identify a vector in the (2, 2, 2 6, 0 16 ) orbit B with the block of six coordinates (other than the first two) containing its 2s. Then has inner product 1 with each x X and inner product 2 with each B B; any two x 1, x 2 X have inner product 2; vectors x X and B B have inner product 1 exactly when the 3 pairs with a 2, i.e. when B s six-tuple contains x s coordinate; and two vectors B 1, B 2 B have inner product 1 exactly when their six-tuples do not intersect. This completes the proof. 5. Connections with the Hoffman-Singleton Graph Finally, we mention (without proof) some connections between the Higman-Sims graph and maximal cocliques in the Hoffman-Singleton graph G Hof. The verification of some of these facts is illustrated in [2, 3.6] using the GRAPE computational package inside GAP, and the rest may be verified in the same way. From its strongly regular parameters (50, 7, 0, 1), the Hoffman-Singleton graph is seen to have eigenvalues r = 2 (multiplicity 28) and s = 3 (multiplicity 21) as well as 7 (multiplicity 1). It is known that in any k-regular graph on n vertices with minimal eigenvalue s, a maximal coclique has size at most ns/(k s), which for G Hof is (50)( 3)/(7 + 3) = 15. It can be checked that G Hof has exactly 100 cocliques of size 15, any two of which intersect in 0, 3, 5, 8, or 15 vertices. Form the graph on these 100 cocliques, where two cocliques are joined if they intersect in 0 or 8 vertices. The resulting graph is the Higman-Sims graph, as in [2] The 100 cocliques in G Hof are naturally divided into two equivalence classes of size 50, where two cocliques are in the same class if they intersect in 0, 5, or 15 vertices. Within each class, connecting disjoint cocliques creates a copy of the Hoffman-Singleton graph, and the above construction then shows that the Higman-Sims graph may be partitioned into two Hoffman-Singleton graphs; in fact, in [4] it is shown that there are exactly

7 COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH such partitions. These equivalence classes also offer an alternative construction of G HS from G Hof : Form a graph on the 50 vertices of G Hof and the 50 cocliques from one of the equivalence classes, where two vertices v 1, v 2 V (G Hof ) are joined if they are connected in G Hof, two cocliques are joined if they are disjoint, and a vertex v V (G Hof ) connects to a coclique C precisely when v C. Then this graph is also the Higman-Sims graph. References [1] A.E. Brouwer. The uniqueness of the strongly regular graph on 77 points. Journal of Graph Theory, 7: , [2] P.J. Cameron. Permutation Groups, volume 45 of London Mathematical Society Student Texts. Cambridge University Press, [3] A. Gewirtz. Graphs with maximal even girth. Canadian Journal of Mathematics, 21: , [4] P.R. Hafner. On the graphs of hoffman-singleton and higman-sims. Electronic Journal of Combinatorics, 11(1), [5] Robert A. Wilson. The Finite Simple Groups. Graduate Texts in Mathematics. Springer, 2009.

### G = G 0 > G 1 > > G k = {e}

Proposition 49. 1. A group G is nilpotent if and only if G appears as an element of its upper central series. 2. If G is nilpotent, then the upper central series and the lower central series have the same

### Every tree contains a large induced subgraph with all degrees odd

Every tree contains a large induced subgraph with all degrees odd A.J. Radcliffe Carnegie Mellon University, Pittsburgh, PA A.D. Scott Department of Pure Mathematics and Mathematical Statistics University

### I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

### minimal polyonomial Example

Minimal Polynomials Definition Let α be an element in GF(p e ). We call the monic polynomial of smallest degree which has coefficients in GF(p) and α as a root, the minimal polyonomial of α. Example: We

### = 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that

Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without

### Triangle deletion. Ernie Croot. February 3, 2010

Triangle deletion Ernie Croot February 3, 2010 1 Introduction The purpose of this note is to give an intuitive outline of the triangle deletion theorem of Ruzsa and Szemerédi, which says that if G = (V,

### INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS

INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS STEVEN P. LALLEY AND ANDREW NOBEL Abstract. It is shown that there are no consistent decision rules for the hypothesis testing problem

### All trees contain a large induced subgraph having all degrees 1 (mod k)

All trees contain a large induced subgraph having all degrees 1 (mod k) David M. Berman, A.J. Radcliffe, A.D. Scott, Hong Wang, and Larry Wargo *Department of Mathematics University of New Orleans New

### Outline 2.1 Graph Isomorphism 2.2 Automorphisms and Symmetry 2.3 Subgraphs, part 1

GRAPH THEORY LECTURE STRUCTURE AND REPRESENTATION PART A Abstract. Chapter focuses on the question of when two graphs are to be regarded as the same, on symmetries, and on subgraphs.. discusses the concept

### Group Theory. Contents

Group Theory Contents Chapter 1: Review... 2 Chapter 2: Permutation Groups and Group Actions... 3 Orbits and Transitivity... 6 Specific Actions The Right regular and coset actions... 8 The Conjugation

### ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS

ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS DANIEL RABAYEV AND JACK SONN Abstract. Let f(x) be a monic polynomial in Z[x] with no rational roots but with roots in Q p for

### Graph Theory Problems and Solutions

raph Theory Problems and Solutions Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles November, 005 Problems. Prove that the sum of the degrees of the vertices of any finite graph is

### A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE. 1. Introduction and Preliminaries

Acta Math. Univ. Comenianae Vol. LXVI, 2(1997), pp. 285 291 285 A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE E. T. BASKORO, M. MILLER and J. ŠIRÁŇ Abstract. It is well known that Moore digraphs do

### Collinear Points in Permutations

Collinear Points in Permutations Joshua N. Cooper Courant Institute of Mathematics New York University, New York, NY József Solymosi Department of Mathematics University of British Columbia, Vancouver,

### Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

### Introduction to Finite Fields (cont.)

Chapter 6 Introduction to Finite Fields (cont.) 6.1 Recall Theorem. Z m is a field m is a prime number. Theorem (Subfield Isomorphic to Z p ). Every finite field has the order of a power of a prime number

### A Sublinear Bipartiteness Tester for Bounded Degree Graphs

A Sublinear Bipartiteness Tester for Bounded Degree Graphs Oded Goldreich Dana Ron February 5, 1998 Abstract We present a sublinear-time algorithm for testing whether a bounded degree graph is bipartite

### Introduction to Graph Theory

Introduction to Graph Theory Allen Dickson October 2006 1 The Königsberg Bridge Problem The city of Königsberg was located on the Pregel river in Prussia. The river divided the city into four separate

### Labeling outerplanar graphs with maximum degree three

Labeling outerplanar graphs with maximum degree three Xiangwen Li 1 and Sanming Zhou 2 1 Department of Mathematics Huazhong Normal University, Wuhan 430079, China 2 Department of Mathematics and Statistics

### Graphs without proper subgraphs of minimum degree 3 and short cycles

Graphs without proper subgraphs of minimum degree 3 and short cycles Lothar Narins, Alexey Pokrovskiy, Tibor Szabó Department of Mathematics, Freie Universität, Berlin, Germany. August 22, 2014 Abstract

### Classification of Cartan matrices

Chapter 7 Classification of Cartan matrices In this chapter we describe a classification of generalised Cartan matrices This classification can be compared as the rough classification of varieties in terms

### The Open University s repository of research publications and other research outputs

Open Research Online The Open University s repository of research publications and other research outputs The degree-diameter problem for circulant graphs of degree 8 and 9 Journal Article How to cite:

### most 4 Mirka Miller 1,2, Guillermo Pineda-Villavicencio 3, The University of Newcastle Callaghan, NSW 2308, Australia University of West Bohemia

Complete catalogue of graphs of maimum degree 3 and defect at most 4 Mirka Miller 1,2, Guillermo Pineda-Villavicencio 3, 1 School of Electrical Engineering and Computer Science The University of Newcastle

### Tree sums and maximal connected I-spaces

Tree sums and maximal connected I-spaces Adam Bartoš drekin@gmail.com Faculty of Mathematics and Physics Charles University in Prague Twelfth Symposium on General Topology Prague, July 2016 Maximal and

### IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction

IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL R. DRNOVŠEK, T. KOŠIR Dedicated to Prof. Heydar Radjavi on the occasion of his seventieth birthday. Abstract. Let S be an irreducible

### Markov random fields and Gibbs measures

Chapter Markov random fields and Gibbs measures 1. Conditional independence Suppose X i is a random element of (X i, B i ), for i = 1, 2, 3, with all X i defined on the same probability space (.F, P).

### On Integer Additive Set-Indexers of Graphs

On Integer Additive Set-Indexers of Graphs arxiv:1312.7672v4 [math.co] 2 Mar 2014 N K Sudev and K A Germina Abstract A set-indexer of a graph G is an injective set-valued function f : V (G) 2 X such that

### A Turán Type Problem Concerning the Powers of the Degrees of a Graph

A Turán Type Problem Concerning the Powers of the Degrees of a Graph Yair Caro and Raphael Yuster Department of Mathematics University of Haifa-ORANIM, Tivon 36006, Israel. AMS Subject Classification:

### Math 319 Problem Set #3 Solution 21 February 2002

Math 319 Problem Set #3 Solution 21 February 2002 1. ( 2.1, problem 15) Find integers a 1, a 2, a 3, a 4, a 5 such that every integer x satisfies at least one of the congruences x a 1 (mod 2), x a 2 (mod

### Cycles in a Graph Whose Lengths Differ by One or Two

Cycles in a Graph Whose Lengths Differ by One or Two J. A. Bondy 1 and A. Vince 2 1 LABORATOIRE DE MATHÉMATIQUES DISCRÉTES UNIVERSITÉ CLAUDE-BERNARD LYON 1 69622 VILLEURBANNE, FRANCE 2 DEPARTMENT OF MATHEMATICS

### An inequality for the group chromatic number of a graph

An inequality for the group chromatic number of a graph Hong-Jian Lai 1, Xiangwen Li 2 and Gexin Yu 3 1 Department of Mathematics, West Virginia University Morgantown, WV 26505 USA 2 Department of Mathematics

### Chapter 7: Products and quotients

Chapter 7: Products and quotients Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 42, Spring 24 M. Macauley (Clemson) Chapter 7: Products

### GROUPS ACTING ON A SET

GROUPS ACTING ON A SET MATH 435 SPRING 2012 NOTES FROM FEBRUARY 27TH, 2012 1. Left group actions Definition 1.1. Suppose that G is a group and S is a set. A left (group) action of G on S is a rule for

### CSC2420 Fall 2012: Algorithm Design, Analysis and Theory

CSC2420 Fall 2012: Algorithm Design, Analysis and Theory Allan Borodin November 15, 2012; Lecture 10 1 / 27 Randomized online bipartite matching and the adwords problem. We briefly return to online algorithms

### Midterm Practice Problems

6.042/8.062J Mathematics for Computer Science October 2, 200 Tom Leighton, Marten van Dijk, and Brooke Cowan Midterm Practice Problems Problem. [0 points] In problem set you showed that the nand operator

### POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS

POLYNOMIAL RINGS AND UNIQUE FACTORIZATION DOMAINS RUSS WOODROOFE 1. Unique Factorization Domains Throughout the following, we think of R as sitting inside R[x] as the constant polynomials (of degree 0).

### CS 598CSC: Combinatorial Optimization Lecture date: 2/4/2010

CS 598CSC: Combinatorial Optimization Lecture date: /4/010 Instructor: Chandra Chekuri Scribe: David Morrison Gomory-Hu Trees (The work in this section closely follows [3]) Let G = (V, E) be an undirected

### Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs

Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs Kousha Etessami U. of Edinburgh, UK Kousha Etessami (U. of Edinburgh, UK) Discrete Mathematics (Chapter 6) 1 / 13 Overview Graphs and Graph

GENERATING SETS KEITH CONRAD 1 Introduction In R n, every vector can be written as a unique linear combination of the standard basis e 1,, e n A notion weaker than a basis is a spanning set: a set of vectors

### Stationary random graphs on Z with prescribed iid degrees and finite mean connections

Stationary random graphs on Z with prescribed iid degrees and finite mean connections Maria Deijfen Johan Jonasson February 2006 Abstract Let F be a probability distribution with support on the non-negative

PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient

### Minimally Infeasible Set Partitioning Problems with Balanced Constraints

Minimally Infeasible Set Partitioning Problems with alanced Constraints Michele Conforti, Marco Di Summa, Giacomo Zambelli January, 2005 Revised February, 2006 Abstract We study properties of systems of

### n 2 + 4n + 3. The answer in decimal form (for the Blitz): 0, 75. Solution. (n + 1)(n + 3) = n + 3 2 lim m 2 1

. Calculate the sum of the series Answer: 3 4. n 2 + 4n + 3. The answer in decimal form (for the Blitz):, 75. Solution. n 2 + 4n + 3 = (n + )(n + 3) = (n + 3) (n + ) = 2 (n + )(n + 3) ( 2 n + ) = m ( n

### 6.2 Permutations continued

6.2 Permutations continued Theorem A permutation on a finite set A is either a cycle or can be expressed as a product (composition of disjoint cycles. Proof is by (strong induction on the number, r, of

### Mean Ramsey-Turán numbers

Mean Ramsey-Turán numbers Raphael Yuster Department of Mathematics University of Haifa at Oranim Tivon 36006, Israel Abstract A ρ-mean coloring of a graph is a coloring of the edges such that the average

### Odd induced subgraphs in graphs of maximum degree three

Odd induced subgraphs in graphs of maximum degree three David M. Berman, Hong Wang, and Larry Wargo Department of Mathematics University of New Orleans New Orleans, Louisiana, USA 70148 Abstract A long-standing

### COUNTING INDEPENDENT SETS IN SOME CLASSES OF (ALMOST) REGULAR GRAPHS

COUNTING INDEPENDENT SETS IN SOME CLASSES OF (ALMOST) REGULAR GRAPHS Alexander Burstein Department of Mathematics Howard University Washington, DC 259, USA aburstein@howard.edu Sergey Kitaev Mathematics

### SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH

31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,

### Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010. Chapter 7: Digraphs

MCS-236: Graph Theory Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010 Chapter 7: Digraphs Strong Digraphs Definitions. A digraph is an ordered pair (V, E), where V is the set

### 11 Ideals. 11.1 Revisiting Z

11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(

### DETERMINANTS IN THE KRONECKER PRODUCT OF MATRICES: THE INCIDENCE MATRIX OF A COMPLETE GRAPH

DETERMINANTS IN THE KRONECKER PRODUCT OF MATRICES: THE INCIDENCE MATRIX OF A COMPLETE GRAPH CHRISTOPHER RH HANUSA AND THOMAS ZASLAVSKY Abstract We investigate the least common multiple of all subdeterminants,

### On end degrees and infinite cycles in locally finite graphs

On end degrees and infinite cycles in locally finite graphs Henning Bruhn Maya Stein Abstract We introduce a natural extension of the vertex degree to ends. For the cycle space C(G) as proposed by Diestel

### . 0 1 10 2 100 11 1000 3 20 1 2 3 4 5 6 7 8 9

Introduction The purpose of this note is to find and study a method for determining and counting all the positive integer divisors of a positive integer Let N be a given positive integer We say d is a

### The positive minimum degree game on sparse graphs

The positive minimum degree game on sparse graphs József Balogh Department of Mathematical Sciences University of Illinois, USA jobal@math.uiuc.edu András Pluhár Department of Computer Science University

### Galois representations with open image

Galois representations with open image Ralph Greenberg University of Washington Seattle, Washington, USA May 7th, 2011 Introduction This talk will be about representations of the absolute Galois group

### Class One: Degree Sequences

Class One: Degree Sequences For our purposes a graph is a just a bunch of points, called vertices, together with lines or curves, called edges, joining certain pairs of vertices. Three small examples of

### Definition 11.1. Given a graph G on n vertices, we define the following quantities:

Lecture 11 The Lovász ϑ Function 11.1 Perfect graphs We begin with some background on perfect graphs. graphs. First, we define some quantities on Definition 11.1. Given a graph G on n vertices, we define

### WOLLONGONG COLLEGE AUSTRALIA. Diploma in Information Technology

First Name: Family Name: Student Number: Class/Tutorial: WOLLONGONG COLLEGE AUSTRALIA A College of the University of Wollongong Diploma in Information Technology Final Examination Spring Session 2008 WUCT121

### SUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by

SUBGROUPS OF CYCLIC GROUPS KEITH CONRAD 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by g = {g k : k Z}. If G = g, then G itself is cyclic, with g as a generator. Examples

### 3. Eulerian and Hamiltonian Graphs

3. Eulerian and Hamiltonian Graphs There are many games and puzzles which can be analysed by graph theoretic concepts. In fact, the two early discoveries which led to the existence of graphs arose from

### Algebra of the 2x2x2 Rubik s Cube

Algebra of the 2x2x2 Rubik s Cube Under the direction of Dr. John S. Caughman William Brad Benjamin. Introduction As children, many of us spent countless hours playing with Rubiks Cube. At the time it

### Lecture 17 : Equivalence and Order Relations DRAFT

CS/Math 240: Introduction to Discrete Mathematics 3/31/2011 Lecture 17 : Equivalence and Order Relations Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last lecture we introduced the notion

### Pigeonhole Principle Solutions

Pigeonhole Principle Solutions 1. Show that if we take n + 1 numbers from the set {1, 2,..., 2n}, then some pair of numbers will have no factors in common. Solution: Note that consecutive numbers (such

### Product irregularity strength of certain graphs

Also available at http://amc.imfm.si ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 7 (014) 3 9 Product irregularity strength of certain graphs Marcin Anholcer

### Split Nonthreshold Laplacian Integral Graphs

Split Nonthreshold Laplacian Integral Graphs Stephen Kirkland University of Regina, Canada kirkland@math.uregina.ca Maria Aguieiras Alvarez de Freitas Federal University of Rio de Janeiro, Brazil maguieiras@im.ufrj.br

### GRAPH THEORY LECTURE 4: TREES

GRAPH THEORY LECTURE 4: TREES Abstract. 3.1 presents some standard characterizations and properties of trees. 3.2 presents several different types of trees. 3.7 develops a counting method based on a bijection

### The chromatic spectrum of mixed hypergraphs

The chromatic spectrum of mixed hypergraphs Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly Voloshin, Douglas B. West March 30, 2003 Abstract A mixed hypergraph is a triple H = (X, C, D), where X is the vertex

### UNCOUPLING THE PERRON EIGENVECTOR PROBLEM

UNCOUPLING THE PERRON EIGENVECTOR PROBLEM Carl D Meyer INTRODUCTION Foranonnegative irreducible matrix m m with spectral radius ρ,afundamental problem concerns the determination of the unique normalized

### INCIDENCE-BETWEENNESS GEOMETRY

INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full

### Social Media Mining. Graph Essentials

Graph Essentials Graph Basics Measures Graph and Essentials Metrics 2 2 Nodes and Edges A network is a graph nodes, actors, or vertices (plural of vertex) Connections, edges or ties Edge Node Measures

### Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

### 8. Matchings and Factors

8. Matchings and Factors Consider the formation of an executive council by the parliament committee. Each committee needs to designate one of its members as an official representative to sit on the council,

### Connectivity and cuts

Math 104, Graph Theory February 19, 2013 Measure of connectivity How connected are each of these graphs? > increasing connectivity > I G 1 is a tree, so it is a connected graph w/minimum # of edges. Every

### Tools for parsimonious edge-colouring of graphs with maximum degree three. J.L. Fouquet and J.M. Vanherpe. Rapport n o RR-2010-10

Tools for parsimonious edge-colouring of graphs with maximum degree three J.L. Fouquet and J.M. Vanherpe LIFO, Université d Orléans Rapport n o RR-2010-10 Tools for parsimonious edge-colouring of graphs

### Practical Guide to the Simplex Method of Linear Programming

Practical Guide to the Simplex Method of Linear Programming Marcel Oliver Revised: April, 0 The basic steps of the simplex algorithm Step : Write the linear programming problem in standard form Linear

### Large induced subgraphs with all degrees odd

Large induced subgraphs with all degrees odd A.D. Scott Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, England Abstract: We prove that every connected graph of order

### Approximation Algorithms

Approximation Algorithms or: How I Learned to Stop Worrying and Deal with NP-Completeness Ong Jit Sheng, Jonathan (A0073924B) March, 2012 Overview Key Results (I) General techniques: Greedy algorithms

### 136 CHAPTER 4. INDUCTION, GRAPHS AND TREES

136 TER 4. INDUCTION, GRHS ND TREES 4.3 Graphs In this chapter we introduce a fundamental structural idea of discrete mathematics, that of a graph. Many situations in the applications of discrete mathematics

### 5 Directed acyclic graphs

5 Directed acyclic graphs (5.1) Introduction In many statistical studies we have prior knowledge about a temporal or causal ordering of the variables. In this chapter we will use directed graphs to incorporate

### Linear Algebra Notes for Marsden and Tromba Vector Calculus

Linear Algebra Notes for Marsden and Tromba Vector Calculus n-dimensional Euclidean Space and Matrices Definition of n space As was learned in Math b, a point in Euclidean three space can be thought of

### Cameron Liebler line classes

Cameron Liebler line classes Alexander Gavrilyuk Krasovsky Institute of Mathematics and Mechanics, (Yekaterinburg, Russia) based on joint work with Ivan Mogilnykh, Institute of Mathematics (Novosibirsk,

### 3. Linear Programming and Polyhedral Combinatorics

Massachusetts Institute of Technology Handout 6 18.433: Combinatorial Optimization February 20th, 2009 Michel X. Goemans 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the

### Math Workshop October 2010 Fractions and Repeating Decimals

Math Workshop October 2010 Fractions and Repeating Decimals This evening we will investigate the patterns that arise when converting fractions to decimals. As an example of what we will be looking at,

### An inequality for the group chromatic number of a graph

Discrete Mathematics 307 (2007) 3076 3080 www.elsevier.com/locate/disc Note An inequality for the group chromatic number of a graph Hong-Jian Lai a, Xiangwen Li b,,1, Gexin Yu c a Department of Mathematics,

### Degree Hypergroupoids Associated with Hypergraphs

Filomat 8:1 (014), 119 19 DOI 10.98/FIL1401119F Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Degree Hypergroupoids Associated

### SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS. Nickolay Khadzhiivanov, Nedyalko Nenov

Serdica Math. J. 30 (2004), 95 102 SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS Nickolay Khadzhiivanov, Nedyalko Nenov Communicated by V. Drensky Abstract. Let Γ(M) where M V (G) be the set of all vertices

### The four [10,5,4] binary codes

1 Preliminaries The four [10,,] binary codes There are four distinct [10; ; ] binary codes. We shall prove this in a moderately elementary way, using the MacWilliams identities as the main tool. (For the

### Efficient Recovery of Secrets

Efficient Recovery of Secrets Marcel Fernandez Miguel Soriano, IEEE Senior Member Department of Telematics Engineering. Universitat Politècnica de Catalunya. C/ Jordi Girona 1 i 3. Campus Nord, Mod C3,

### Cycles and clique-minors in expanders

Cycles and clique-minors in expanders Benny Sudakov UCLA and Princeton University Expanders Definition: The vertex boundary of a subset X of a graph G: X = { all vertices in G\X with at least one neighbor

### P. Jeyanthi and N. Angel Benseera

Opuscula Math. 34, no. 1 (014), 115 1 http://dx.doi.org/10.7494/opmath.014.34.1.115 Opuscula Mathematica A TOTALLY MAGIC CORDIAL LABELING OF ONE-POINT UNION OF n COPIES OF A GRAPH P. Jeyanthi and N. Angel

### CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY

January 10, 2010 CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY The set of polynomials over a field F is a ring, whose structure shares with the ring of integers many characteristics.

### 17. Inner product spaces Definition 17.1. Let V be a real vector space. An inner product on V is a function

17. Inner product spaces Definition 17.1. Let V be a real vector space. An inner product on V is a function, : V V R, which is symmetric, that is u, v = v, u. bilinear, that is linear (in both factors):

### SHORT CYCLE COVERS OF GRAPHS WITH MINIMUM DEGREE THREE

SHOT YLE OVES OF PHS WITH MINIMUM DEEE THEE TOMÁŠ KISE, DNIEL KÁL, END LIDIKÝ, PVEL NEJEDLÝ OET ŠÁML, ND bstract. The Shortest ycle over onjecture of lon and Tarsi asserts that the edges of every bridgeless

### Chapter 17. Orthogonal Matrices and Symmetries of Space

Chapter 17. Orthogonal Matrices and Symmetries of Space Take a random matrix, say 1 3 A = 4 5 6, 7 8 9 and compare the lengths of e 1 and Ae 1. The vector e 1 has length 1, while Ae 1 = (1, 4, 7) has length

### The Goldberg Rao Algorithm for the Maximum Flow Problem

The Goldberg Rao Algorithm for the Maximum Flow Problem COS 528 class notes October 18, 2006 Scribe: Dávid Papp Main idea: use of the blocking flow paradigm to achieve essentially O(min{m 2/3, n 1/2 }

### Notes on Determinant

ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without

### LEARNING OBJECTIVES FOR THIS CHAPTER

CHAPTER 2 American mathematician Paul Halmos (1916 2006), who in 1942 published the first modern linear algebra book. The title of Halmos s book was the same as the title of this chapter. Finite-Dimensional

### DATA ANALYSIS II. Matrix Algorithms

DATA ANALYSIS II Matrix Algorithms Similarity Matrix Given a dataset D = {x i }, i=1,..,n consisting of n points in R d, let A denote the n n symmetric similarity matrix between the points, given as where