On the crossing number of K m,n


 Randolf Rich
 3 years ago
 Views:
Transcription
1 On the crossing number of K m,n Nagi H. Nahas Submitted: Mar 15, 001; Accepted: Aug 10, 00; Published: Aug 1, 00 MR Subject Classifications: 05C10, 05C5 Abstract The best lower bound known on the crossing number of the complete bipartite graph is : cr(k m,n ) (1/5)(m)(m 1) n/ (n 1)/ In this paper we prove that: cr(k m,n ) (1/5)m(m 1) n/ (n 1)/ m n for sufficiently large m and n. 1 Introduction Determining the crossing number of the complete bipartite graph is one of the oldest crossing number open problems. It was first posed by Turan and known as Turan s brick factory problem. In 1954, Zarankiewicz conjectured that it is equal to Z(m, n) = n/ (n 1)/ m/ (m 1)/ He even gave a proof and a drawing that matches the lower bound, but the proof was shown to be flawed by Richard Guy [1]. Then in 1970 Kleitman proved that Zarankiewicz conjecture holds for Min(m, n) 6 []. In 199 Woodall proved it for m 8,n 10 []. Previously the best known lower bound in the general case was the one proved by Kleitman [] : cr(k m,n ) (1/5)(m)(m 1) n/ (n 1)/. Richter and Thomassen discussed the relation between the crossing numbers of the complete and the complete bipartite graphs [4]. the electronic journal of combinatorics 10 (00), #N8 1
2 A new bound We will start by giving definitions that will be used throughout the paper. They are taken from Woodall[] and Kleitman []. Definition 1 Two edges e 1 and e are said to have a crossing in a drawing D of K m,n if e 1 can be closed by a curve disjoint from e connecting the two endpoints of e 1 and such that there are points of e both inside and outside the closed curve. Definition The crossing number cr G of a graph G is the smallest crossing number of any drawing of G in the plane, where the crossing number cr D of a drawing D is the number of nonadjacent edges that have a crossing in the drawing. Definition A good drawing a graph G is a drawing where the edges are nonselfintersecting where each two edges have at most one point in common, which is either a common end vertex or a crossing. Clearly a drawing with minimum crossing number must be a good drawing. Let A be one partite and B the other partite. The elements of A are a 1,a,a,...,a m, and the elements of B are b 1,b,...,b n. In a drawing D, wedenotebycr D (a i,a k )the number of crossings of arcs, one terminating at a i, the other at a k and by cr D (a i )the number of crossings on arcs which terminate at a i : n cr D (a i )= cr D (a i,a k ) k=1 The crossing number of the drawing D is therefore: n n cr D = cr D (a i,a k ) i=1 k=i+1 Let us define : Z(m) = m/ (m 1)/. Let Sn be the set of the (n 1)! different cyclic orderings of a set V n of n elements. (The significance of cyclic ordering is that 014 is considered as being the same as 401 or 140). If z 1 and z belong to Sn then the distance d(z 1,z ) is the minimum number of transpositions between adjacent elements in the cyclic ordering necessary to turn z 1 into z. If a belongs to Sn then ā denotes the reverse ordering of a. For example, in S 7,if a = 05416, then ā = The antidistance d(a, b) between two elements a and b is the distance between ā and b (or between b and a). Woodall [] gave a detailed proof of the two following propositions: Theorem 1 If a S n, then d(a, a) =Z(n). Theorem In a drawing D of K,n on two sets {x, x } and V n, let the clockwise orders in which the edges leave x and x to go to V n be the elements a and b of S n. Then cr D d(a, b), and if n is odd then cr D is of the same parity than d(a, b). the electronic journal of combinatorics 10 (00), #N8
3 Kleitman proved the following equalities: Theorem cr(k 5,n )=4 n/ (n 1)/ (1) cr(k 6,n )=6 n/ (n 1)/. () From this he deduced that cr(k m,n ) (1/5)(m)(m 1) n/ (n 1)/ () in the following way: There are ( ) m K5,n which are subgraphs of K 5 m,n, with the partite with n vertices in the K 5,n being B. Let σ be the sum over all such K 5,n of the number of crossings that each of these K 5,n containinadrawingd. Obviously σ ( ) m 5 Z(5,n). Each crossing appears in exactly ( ) m K5,n. Therefore cr(k m,n ) ( m 5 ) Z(5,n) ( ) m cr(k m,n ) (1/5)(m)(m 1) n/ (n 1)/ We will obtain a small improvement on this lower bound for large values of n, withm 7, by proving that there is a number of K 5,n subgraphs of K m,n which must have more than Z(5,n) crossings in any drawing of K m,n The cyclic ordering of the edges around each b j B can be considered as a cyclic ordering of the elements of A, and therefore as an element of Sm. Suppose we have a K,m which first partite is {u 1,u } and second partite is {u 1,...,u m }. And let c(u 1 ) denote the cyclic ordering of the edges around u 1,andc(u ) denote the cyclic ordering of the edges around u. Woodall [] proved the following theorem: Theorem 4 If a good drawing of K,m has r crossings, there is a sequence Seq(u 1,u ) of r transpositions between adjacent elements in c(u 1 ), such that if we apply this sequence to c(u 1 ) we obtain c(u ), and there is a crossing in the K, subgraph of K,m on vertices u 1,u,u i,u i if and only if exactly one of the transpositions takes place between elements u i and u i in Seq(u 1,u ). (In a good drawing a K, can have one crossing at most.) We can now prove our first lemma: Lemma 1 In any K,7 subgraph of K(m, n) where the two vertices with 7 edges have the same cyclic ordering of edges, there is a K,4 subgraph which has 6 crossings. Proof :Let A beasubsetof7elementsofa, sayw 1,w,...,w 7 (for every l, w l = a k for some k). Let {b k,b l } be one partite of a K,7 subgraph G of K m,n and let A be the second partite. Now suppose c(b k )=c(b l )ing. Let W (b k,b l )bethesetofpairs{w i,w i } of elements of A such that there is a transposition exchanging w i and w i in Seq(b k,b l )inthe drawing of G. Letw y be one element of A,andletA = A \{w y }.LetA 1 be the set of the electronic journal of combinatorics 10 (00), #N8
4 elements a x of A such that {a x,w y } W (b k,b l )anda = A \ A 1. It is clear that every triple {w y,w z,w z } reverses its ordering between c(b k )and c(b l )= c(b k ), which implies that either all three pairs {w z,w z }, {w y,w z }, {w y,w z } belong to W (b k,b l )orexactlyone of these pairs belong to W (b k,b l ). Therefore, if a pair of elements {w z,w z } A either has both of its elements in A 1 or has both of its elements in A,then{w z,w z } W (b k,b l ). Either Card(A ) 4ornot. IfCard(A ) 4, every 4subset of A has 6 subsets that belong W (b k,b l ). If Card(A ) < 4, Card(A 1 ), and every subset of A 1 has  subset belong W (b k,b l ). Let A 1 be such a subset. Then A 1 U{w y} is a 4subset that has 6 subsets in W (b k,b l ). Therefore there exists a subgraph χ of G, having 6 crossings, where one partite is {b k,b l } and the other partite is a 4subset. There are distinct K,5 in G that have χ as a subgraph so each of them must have at least 6 crossings. We will also need the following lemma : Lemma Let D 5,z be an arbitrary drawing of some K 5,z and let t 0 be an element of the partite F with z elements and let T be the set of all elements of F having the same cyclic ordering of edges incident on them as t 0. The elements of T are t 0,t 1,... Let η be the number of pairs {t k T,t k T } such that cr D5,z (t k,t k ) 6 Z(, 5) +. Then Z(5,z)+η cr D5,z. Proof:Let h(t k ) be the sum of the number of crossings of the edges of t k with edges not incident on any vertex of T.Lett min be the element of T such that h(t min ) h(t k ) for all t k T. Using a construction used by Kleitman,[] ( Constructive Argument p19), we can obtain from D 5,z another drawing D 5,z where the position of the edges not incident on a vertex of T remains unchanged, and h(t k )=h(t min ) for all k, and cr D 5,z (t k,t k )=Z(, 5). (The construction mainly consists at placing t k close to t min and letting the edges incident on t k follow the path of the corresponding edges of t min.) Therefore Z(5,z)+η cr D 5,z +η cr D5,z Let θ be the number of distinct K,5 subgraphs of K m,n having at least 6 crossings in D and such that the partite with elements is a subset of B, and the partite with 5 elements is a subset of A, andletσ have the same definition as it had in the proof of (). Then σ ( ) m 5 Z(5,n)+θ. In the following lemma, A is defined in the same way as in the proof of Lemma 1. Lemma Let λ be the number of distinct pairs of elements of B having the same cyclic ordering of edges incident on an element of A. Then, if n 6!, we have ( ) n/6! λ (6!) the electronic journal of combinatorics 10 (00), #N8 4
5 Proof : Let α 1 and α be two distinct elements of (S7)andletn α1 be the number of vertices of B having the cyclic ordering of their edges equal to α 1 and let n α be the number of vertices of B having the cyclic ordering of their edges equal to α.ifn α1 n α, it is always possible to reduce the number of pairs of vertices having the same cyclic ordering of edges by assigning α to one of the vertices which cyclic ordering of edges was α 1.So the minimum possible number of pairs of vertices having the same cyclic ordering of edges can only occur if n α1 n α =1or n α1 n α = 0 for all {α 1,α } S7. Therefore ( ) n/6! λ (6!) Let ν be the minimum number of K,5 subgraphs of a K,7 whose number of crossings must be at least 6 when cyclic ordering of the 7 edges around the vertices of the partite with ) elements are identical. As noted previously ν =. is the number of K,7 subgraphs of K n,m in which a given K,5 appears. ( m 5 θ ( ) m 7 λν ( ) m 5 From the above we can deduce a new lower bound on the crossing number of K m,n. We have: cr(k m,n ) σ ) ( m ( ) m σ Z(5,n)+θ 5 ( ) ( ) ( ) m 5 Z(5,n)+λν m 7 / m 5 cr(k m,n ) ) (4) For sufficiently large m and n, we therefore have : ( m cr(k m,n ) (1/5)m(m 1) n/ (n 1)/ m n Conclusion In this paper, we have proved a new lower bound on the crossing number of K m,n by proving the existence of certain non optimal drawings of K 5,n subgraphs in any drawing of K m,n. By proving the existence of other non optimal drawings, we might perhaps get improvements on the current lower bound. So this method could be one possible way to progress on Zarankiewicz conjecture. the electronic journal of combinatorics 10 (00), #N8 5
6 References [1] R. K. Guy, The decline and fall of Zarankiewicz s theorem, Proof techniques in Graph Theory, F. Harary, ed. Academic Press, New York (1969), [] Daniel J. Kleitman, The crossing number of K 5,n, J. Combinatorial Theory 9 (1970), 15. [] D. R. Woodall, CyclicOrder Graphs and Zarankiewicz s crossing number conjecture, J. Graph Theory 17 (199), [4] R. Bruce Richter, Carsten Thomassen, Relations between crossing numbers of complete and complete bipartite graphs, The American Mathematical Monthly 104 (1997), the electronic journal of combinatorics 10 (00), #N8 6
Removing Even Crossings
EuroComb 2005 DMTCS proc. AE, 2005, 105 110 Removing Even Crossings Michael J. Pelsmajer 1, Marcus Schaefer 2 and Daniel Štefankovič 2 1 Department of Applied Mathematics, Illinois Institute of Technology,
More informationPlanar Graph and Trees
Dr. Nahid Sultana December 16, 2012 Tree Spanning Trees Minimum Spanning Trees Maps and Regions Eulers Formula Nonplanar graph Dual Maps and the Four Color Theorem Tree Spanning Trees Minimum Spanning
More informationEvery 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
More information1. Relevant standard graph theory
Color identical pairs in 4chromatic graphs Asbjørn Brændeland I argue that, given a 4chromatic graph G and a pair of vertices {u, v} in G, if the color of u equals the color of v in every 4coloring
More information(a) (b) (c) Figure 1 : Graphs, multigraphs and digraphs. If the vertices of the leftmost figure are labelled {1, 2, 3, 4} in clockwise order from
4 Graph Theory Throughout these notes, a graph G is a pair (V, E) where V is a set and E is a set of unordered pairs of elements of V. The elements of V are called vertices and the elements of E are called
More informationOn Integer Additive SetIndexers of Graphs
On Integer Additive SetIndexers of Graphs arxiv:1312.7672v4 [math.co] 2 Mar 2014 N K Sudev and K A Germina Abstract A setindexer of a graph G is an injective setvalued function f : V (G) 2 X such that
More information1 Plane and Planar Graphs. Definition 1 A graph G(V,E) is called plane if
Plane and Planar Graphs Definition A graph G(V,E) is called plane if V is a set of points in the plane; E is a set of curves in the plane such that. every curve contains at most two vertices and these
More information136 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
More informationCycles 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É CLAUDEBERNARD LYON 1 69622 VILLEURBANNE, FRANCE 2 DEPARTMENT OF MATHEMATICS
More informationSHARP 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.,
More informationClass 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
More informationCOMBINATORIAL PROPERTIES OF THE HIGMANSIMS GRAPH. 1. Introduction
COMBINATORIAL PROPERTIES OF THE HIGMANSIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the HigmanSims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact
More informationColoring Eulerian triangulations of the projective plane
Coloring Eulerian triangulations of the projective plane Bojan Mohar 1 Department of Mathematics, University of Ljubljana, 1111 Ljubljana, Slovenia bojan.mohar@unilj.si Abstract A simple characterization
More informationZachary Monaco Georgia College Olympic Coloring: Go For The Gold
Zachary Monaco Georgia College Olympic Coloring: Go For The Gold Coloring the vertices or edges of a graph leads to a variety of interesting applications in graph theory These applications include various
More informationThe 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
More informationBasic Notions on Graphs. Planar Graphs and Vertex Colourings. Joe Ryan. Presented by
Basic Notions on Graphs Planar Graphs and Vertex Colourings Presented by Joe Ryan School of Electrical Engineering and Computer Science University of Newcastle, Australia Planar graphs Graphs may be drawn
More informationOdd 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 longstanding
More informationIntersection Dimension and Maximum Degree
Intersection Dimension and Maximum Degree N.R. Aravind and C.R. Subramanian The Institute of Mathematical Sciences, Taramani, Chennai  600 113, India. email: {nraravind,crs}@imsc.res.in Abstract We show
More informationPlanarity Planarity
Planarity 8.1 71 Planarity Up until now, graphs have been completely abstract. In Topological Graph Theory, it matters how the graphs are drawn. Do the edges cross? Are there knots in the graph structure?
More informationCOLORED GRAPHS AND THEIR PROPERTIES
COLORED GRAPHS AND THEIR PROPERTIES BEN STEVENS 1. Introduction This paper is concerned with the upper bound on the chromatic number for graphs of maximum vertex degree under three different sets of coloring
More informationTHE 0/1BORSUK CONJECTURE IS GENERICALLY TRUE FOR EACH FIXED DIAMETER
THE 0/1BORSUK CONJECTURE IS GENERICALLY TRUE FOR EACH FIXED DIAMETER JONATHAN P. MCCAMMOND AND GÜNTER ZIEGLER Abstract. In 1933 Karol Borsuk asked whether every compact subset of R d can be decomposed
More informationPartitioning edgecoloured complete graphs into monochromatic cycles and paths
arxiv:1205.5492v1 [math.co] 24 May 2012 Partitioning edgecoloured complete graphs into monochromatic cycles and paths Alexey Pokrovskiy Departement of Mathematics, London School of Economics and Political
More informationGraph Theory. Introduction. Distance in Graphs. Trees. Isabela Drămnesc UVT. Computer Science Department, West University of Timişoara, Romania
Graph Theory Introduction. Distance in Graphs. Trees Isabela Drămnesc UVT Computer Science Department, West University of Timişoara, Romania November 2016 Isabela Drămnesc UVT Graph Theory and Combinatorics
More informationCombinatorics: The Fine Art of Counting
Combinatorics: The Fine Art of Counting Week 9 Lecture Notes Graph Theory For completeness I have included the definitions from last week s lecture which we will be using in today s lecture along with
More information2.3 Scheduling jobs on identical parallel machines
2.3 Scheduling jobs on identical parallel machines There are jobs to be processed, and there are identical machines (running in parallel) to which each job may be assigned Each job = 1,,, must be processed
More informationGraph definition Degree, in, out degree, oriented graph. Complete, regular, bipartite graph. Graph representation, connectivity, adjacency.
Mária Markošová Graph definition Degree, in, out degree, oriented graph. Complete, regular, bipartite graph. Graph representation, connectivity, adjacency. Isomorphism of graphs. Paths, cycles, trials.
More informationMean RamseyTurán numbers
Mean RamseyTurá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
More informationRemoving even crossings
Removing even crossings Michael J. Pelsmajer a, Marcus Schaefer b, Daniel Štefankovič c a Department of Applied Mathematics, Illinois Institute of Technology, Chicago, IL 60616, USA b Department of Computer
More informationGraphs 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
More information10. Graph Matrices Incidence Matrix
10 Graph Matrices Since a graph is completely determined by specifying either its adjacency structure or its incidence structure, these specifications provide far more efficient ways of representing a
More informationOriented Diameter of Graphs with Diameter 3
Oriented Diameter of Graphs with Diameter 3 Peter K. Kwok, Qi Liu, Douglas B. West revised November, 2008 Abstract In 1978, Chvátal and Thomassen proved that every 2edgeconnected graph with diameter
More informationDefinition. A graph is a collection of vertices, and edges between them. They are often represented by a drawing:
1. GRAPHS AND COLORINGS Definition. A graph is a collection of vertices, and edges between them. They are often represented by a drawing: 3 vertices 3 edges 4 vertices 4 edges 4 vertices 6 edges A graph
More informationON INDUCED SUBGRAPHS WITH ALL DEGREES ODD. 1. Introduction
ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD A.D. SCOTT Abstract. Gallai proved that the vertex set of any graph can be partitioned into two sets, each inducing a subgraph with all degrees even. We prove
More informationA 2factor in which each cycle has long length in clawfree graphs
A factor in which each cycle has long length in clawfree graphs Roman Čada Shuya Chiba Kiyoshi Yoshimoto 3 Department of Mathematics University of West Bohemia and Institute of Theoretical Computer Science
More informationMidterm 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
More informationMIXDECOMPOSITON OF THE COMPLETE GRAPH INTO DIRECTED FACTORS OF DIAMETER 2 AND UNDIRECTED FACTORS OF DIAMETER 3. University of Split, Croatia
GLASNIK MATEMATIČKI Vol. 38(58)(2003), 2 232 MIXDECOMPOSITON OF THE COMPLETE GRAPH INTO DIRECTED FACTORS OF DIAMETER 2 AND UNDIRECTED FACTORS OF DIAMETER 3 Damir Vukičević University of Split, Croatia
More informationHandout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010. Chapter 7: Digraphs
MCS236: 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
More informationOn three zerosum Ramseytype problems
On three zerosum Ramseytype problems Noga Alon Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel and Yair Caro Department of Mathematics
More informationGeneralizing the Ramsey Problem through Diameter
Generalizing the Ramsey Problem through Diameter Dhruv Mubayi Submitted: January 8, 001; Accepted: November 13, 001. MR Subject Classifications: 05C1, 05C15, 05C35, 05C55 Abstract Given a graph G and positive
More informationChapter 4: Trees. 2. Theorem: Let T be a graph with n vertices. Then the following statements are equivalent:
9 Properties of Trees. Definitions: Chapter 4: Trees forest  a graph that contains no cycles tree  a connected forest. Theorem: Let T be a graph with n vertices. Then the following statements are equivalent:
More informationLattice Point Geometry: Pick s Theorem and Minkowski s Theorem. Senior Exercise in Mathematics. Jennifer Garbett Kenyon College
Lattice Point Geometry: Pick s Theorem and Minkowski s Theorem Senior Exercise in Mathematics Jennifer Garbett Kenyon College November 18, 010 Contents 1 Introduction 1 Primitive Lattice Triangles 5.1
More informationOn an antiramsey type result
On an antiramsey type result Noga Alon, Hanno Lefmann and Vojtĕch Rödl Abstract We consider antiramsey type results. For a given coloring of the kelement subsets of an nelement set X, where two kelement
More informationCycles and cliqueminors in expanders
Cycles and cliqueminors 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
More informationOn the kpath cover problem for cacti
On the kpath cover problem for cacti Zemin Jin and Xueliang Li Center for Combinatorics and LPMC Nankai University Tianjin 300071, P.R. China zeminjin@eyou.com, x.li@eyou.com Abstract In this paper we
More informationChapter 6 Planarity. Section 6.1 Euler s Formula
Chapter 6 Planarity Section 6.1 Euler s Formula In Chapter 1 we introduced the puzzle of the three houses and the three utilities. The problem was to determine if we could connect each of the three utilities
More information8. 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,
More informationSingle machine parallel batch scheduling with unbounded capacity
Workshop on Combinatorics and Graph Theory 21th, April, 2006 Nankai University Single machine parallel batch scheduling with unbounded capacity Yuan Jinjiang Department of mathematics, Zhengzhou University
More informationRamsey numbers for bipartite graphs with small bandwidth
Ramsey numbers for bipartite graphs with small bandwidth Guilherme O. Mota 1,, Gábor N. Sárközy 2,, Mathias Schacht 3,, and Anusch Taraz 4, 1 Instituto de Matemática e Estatística, Universidade de São
More informationOn 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
More informationLabeling 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
More informationExtremal Wiener Index of Trees with All Degrees Odd
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 70 (2013) 287292 ISSN 03406253 Extremal Wiener Index of Trees with All Degrees Odd Hong Lin School of
More informationThe 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
More informationBOUNDARY EDGE DOMINATION IN GRAPHS
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 04874, ISSN (o) 04955 www.imvibl.org /JOURNALS / BULLETIN Vol. 5(015), 19704 Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS BANJA
More informationA 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 sublineartime algorithm for testing whether a bounded degree graph is bipartite
More informationIE 680 Special Topics in Production Systems: Networks, Routing and Logistics*
IE 680 Special Topics in Production Systems: Networks, Routing and Logistics* Rakesh Nagi Department of Industrial Engineering University at Buffalo (SUNY) *Lecture notes from Network Flows by Ahuja, Magnanti
More informationDiscrete 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
More informationTriangle 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,
More informationHigh degree graphs contain largestar factors
High degree graphs contain largestar factors Dedicated to László Lovász, for his 60th birthday Noga Alon Nicholas Wormald Abstract We show that any finite simple graph with minimum degree d contains a
More informationAll 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
More informationExtremal Graphs without ThreeCycles or FourCycles
Extremal Graphs without ThreeCycles or FourCycles David K. Garnick Department of Computer Science Bowdoin College Brunswick, Maine 04011 Y. H. Harris Kwong Department of Mathematics and Computer Science
More informationarxiv: v2 [math.co] 30 Nov 2015
PLANAR GRAPH IS ON FIRE PRZEMYSŁAW GORDINOWICZ arxiv:1311.1158v [math.co] 30 Nov 015 Abstract. Let G be any connected graph on n vertices, n. Let k be any positive integer. Suppose that a fire breaks out
More informationDegreeassociated reconstruction parameters of complete multipartite graphs and their complements
Degreeassociated reconstruction parameters of complete multipartite graphs and their complements Meijie Ma, Huangping Shi, Hannah Spinoza, Douglas B. West January 23, 2014 Abstract Avertexdeleted subgraphofagraphgisacard.
More informationSolutions to Exercises 8
Discrete Mathematics Lent 2009 MA210 Solutions to Exercises 8 (1) Suppose that G is a graph in which every vertex has degree at least k, where k 1, and in which every cycle contains at least 4 vertices.
More informationAnalysis of Algorithms, I
Analysis of Algorithms, I CSOR W4231.002 Eleni Drinea Computer Science Department Columbia University Thursday, February 26, 2015 Outline 1 Recap 2 Representing graphs 3 Breadthfirst search (BFS) 4 Applications
More informationSocial 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
More informationThe edge slide graph of the ndimensional cube
The edge slide graph of the ndimensional cube Howida AL Fran Institute of Fundamental Sciences Massey University, Manawatu 8th Australia New Zealand Mathematics Convention December 2014 Howida AL Fran
More informationMath 443/543 Graph Theory Notes 4: Connector Problems
Math 443/543 Graph Theory Notes 4: Connector Problems David Glickenstein September 19, 2012 1 Trees and the Minimal Connector Problem Here is the problem: Suppose we have a collection of cities which we
More informationSEQUENCES 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
More informationAvailable online at ScienceDirect. Procedia Computer Science 74 (2015 ) 47 52
Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 74 (05 ) 47 5 International Conference on Graph Theory and Information Security Fractional Metric Dimension of Tree and
More informationCharacterizations of Arboricity of Graphs
Characterizations of Arboricity of Graphs Ruth Haas Smith College Northampton, MA USA Abstract The aim of this paper is to give several characterizations for the following two classes of graphs: (i) graphs
More informationA 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 HaifaORANIM, Tivon 36006, Israel. AMS Subject Classification:
More informationConnectivity 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
More informationOn the Union of Arithmetic Progressions
On the Union of Arithmetic Progressions Shoni Gilboa Rom Pinchasi August, 04 Abstract We show that for any integer n and real ɛ > 0, the union of n arithmetic progressions with pairwise distinct differences,
More informationLecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs
CSE599s: Extremal Combinatorics November 21, 2011 Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs Lecturer: Anup Rao 1 An Arithmetic Circuit Lower Bound An arithmetic circuit is just like
More informationHomework MA 725 Spring, 2012 C. Huneke SELECTED ANSWERS
Homework MA 725 Spring, 2012 C. Huneke SELECTED ANSWERS 1.1.25 Prove that the Petersen graph has no cycle of length 7. Solution: There are 10 vertices in the Petersen graph G. Assume there is a cycle C
More informationComputer Science Department. Technion  IIT, Haifa, Israel. Itai and Rodeh [IR] have proved that for any 2connected graph G and any vertex s G there
 1  THREE TREEPATHS Avram Zehavi Alon Itai Computer Science Department Technion  IIT, Haifa, Israel Abstract Itai and Rodeh [IR] have proved that for any 2connected graph G and any vertex s G there
More information(Knight) 3 : A Graphical Perspective of the Knight's Tour on a MultiLayered Chess Board
Bridgewater State University Virtual Commons  Bridgewater State University Honors Program Theses and Projects Undergraduate Honors Program 522016 (Knight) 3 : A Graphical Perspective of the Knight's
More informationA 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
More informationIntroduction 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
More informationExponential time algorithms for graph coloring
Exponential time algorithms for graph coloring Uriel Feige Lecture notes, March 14, 2011 1 Introduction Let [n] denote the set {1,..., k}. A klabeling of vertices of a graph G(V, E) is a function V [k].
More information(Vertex) Colorings. We can properly color W 6 with. colors and no fewer. Of interest: What is the fewest colors necessary to properly color G?
Vertex Coloring 2.1 33 (Vertex) Colorings Definition: A coloring of a graph G is a labeling of the vertices of G with colors. [Technically, it is a function f : V (G) {1, 2,...,l}.] Definition: A proper
More informationColor fixation, color identity and the Four Color Theorem
Color fixation, color identity and the Four Color Theorem Asbjørn Brændeland I argue that there is no 4chromatic planar graph with a joinable pair of color identical vertices, i.e., given a 4chromatic
More informationRational exponents in extremal graph theory
Rational exponents in extremal graph theory Boris Bukh David Conlon Abstract Given a family of graphs H, the extremal number ex(n, H) is the largest m for which there exists a graph with n vertices and
More informationLecture 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
More informationTotal colorings of planar graphs with small maximum degree
Total colorings of planar graphs with small maximum degree Bing Wang 1,, JianLiang Wu, SiFeng Tian 1 Department of Mathematics, Zaozhuang University, Shandong, 77160, China School of Mathematics, Shandong
More informationLecture notes from Foundations of Markov chain Monte Carlo methods University of Chicago, Spring 2002 Lecture 1, March 29, 2002
Lecture notes from Foundations of Markov chain Monte Carlo methods University of Chicago, Spring 2002 Lecture 1, March 29, 2002 Eric Vigoda Scribe: Varsha Dani & Tom Hayes 1.1 Introduction The aim of this
More informationOn a tree graph dened by a set of cycles
Discrete Mathematics 271 (2003) 303 310 www.elsevier.com/locate/disc Note On a tree graph dened by a set of cycles Xueliang Li a,vctor NeumannLara b, Eduardo RiveraCampo c;1 a Center for Combinatorics,
More informationLarge 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
More informationBrendan D. McKay Computer Science Dept., Vanderbilt University, Nashville, Tennessee 37235
139. Proc. 3rd Car. Conf. Comb. & Comp. pp. 139143 SPANNING TREES IN RANDOM REGULAR GRAPHS Brendan D. McKay Computer Science Dept., Vanderbilt University, Nashville, Tennessee 37235 Let n~ < n2
More informationCSL851: Algorithmic Graph Theory Semester I Lecture 1: July 24
CSL851: Algorithmic Graph Theory Semester I 20132014 Lecture 1: July 24 Lecturer: Naveen Garg Scribes: Suyash Roongta Note: LaTeX template courtesy of UC Berkeley EECS dept. Disclaimer: These notes have
More informationPh.D. Thesis. Judit NagyGyörgy. Supervisor: Péter Hajnal Associate Professor
Online algorithms for combinatorial problems Ph.D. Thesis by Judit NagyGyörgy Supervisor: Péter Hajnal Associate Professor Doctoral School in Mathematics and Computer Science University of Szeged Bolyai
More informationProduct irregularity strength of certain graphs
Also available at http://amc.imfm.si ISSN 18553966 (printed edn.), ISSN 18553974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 7 (014) 3 9 Product irregularity strength of certain graphs Marcin Anholcer
More informationPROBLEM SET 7: PIGEON HOLE PRINCIPLE
PROBLEM SET 7: PIGEON HOLE PRINCIPLE The pigeonhole principle is the following observation: Theorem. Suppose that > kn marbles are distributed over n jars, then one jar will contain at least k + marbles.
More informationSPERNER S LEMMA AND BROUWER S FIXED POINT THEOREM
SPERNER S LEMMA AND BROUWER S FIXED POINT THEOREM ALEX WRIGHT 1. Intoduction A fixed point of a function f from a set X into itself is a point x 0 satisfying f(x 0 ) = x 0. Theorems which establish the
More informationmost 4 Mirka Miller 1,2, Guillermo PinedaVillavicencio 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 PinedaVillavicencio 3, 1 School of Electrical Engineering and Computer Science The University of Newcastle
More informationGraph theoretic techniques in the analysis of uniquely localizable sensor networks
Graph theoretic techniques in the analysis of uniquely localizable sensor networks Bill Jackson 1 and Tibor Jordán 2 ABSTRACT In the network localization problem the goal is to determine the location of
More informationGraphical degree sequences and realizations
swap Graphical and realizations Péter L. Erdös Alfréd Rényi Institute of Mathematics Hungarian Academy of Sciences MAPCON 12 MPIPKS  Dresden, May 15, 2012 swap Graphical and realizations Péter L. Erdös
More informationPlanar Tree Transformation: Results and Counterexample
Planar Tree Transformation: Results and Counterexample Selim G Akl, Kamrul Islam, and Henk Meijer School of Computing, Queen s University Kingston, Ontario, Canada K7L 3N6 Abstract We consider the problem
More informationA counterexample to a result on the tree graph of a graph
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 63(3) (2015), Pages 368 373 A counterexample to a result on the tree graph of a graph Ana Paulina Figueroa Departamento de Matemáticas Instituto Tecnológico
More information9.1. Vertex colouring. 9. Graph colouring. Vertex colouring.
Vertex colouring. 9. Graph colouring kvertexcritical graphs Approximation algorithms Upper bounds for the vertex chromatic number Brooks Theorem and Hajós Conjecture Chromatic Polynomials Colouring of
More information