Research Statement. Andrew Suk
|
|
- Martin Miles
- 7 years ago
- Views:
Transcription
1 Research Statement Andrew Suk 1 Introduction My research interests are combinatorial methods in discrete geometry. In particular, I am interested in extremal problems on geometric objects. My research can be summarized as follows: Extremal results for topological graphs. It follows from Euler s polyhedral formula that every planar graph on n vertices has at most O(n) edges. A natural question to ask is how much can we relax the condition of planarity without violating the conclusion? In joint work with Ackerman, Fox, and Pach [2], we studied several generalizations of planarity. In particular, we obtained new upper bounds on the maximum number of edges in a topological graph not containing a fixed size grid. Tangencies between convex bodies. I have studied the problem on bounding the number of tangencies in a family of n Jordan regions in the plane, which is related to questions on incidences and union complexity. Analyzing the structure of the union of convex bodies or other geometric objects in the plane and in higher dimensions is a classical topic in discrete and computational geometry, with many applications in motion planning and computer graphics (see [3], for a survey). In joint work with Pach and Treml [15], we obtained a tight bound on the maximum number of tangencies in a family of n convex bodies, which can be decomposed into k subfamilies of pairwise disjoint sets. Erdős-Szekeres-type theorems for monotone paths and convex bodies. A classic theorem of Erdős and Szekeres states that every sufficiently large point set in the plane in general position contains n members in convex position. I have studied the problem on generalizing the Erdős-Szekeres theorem to convex bodies in the plane. In joint work with Hubard, Montejano, and Mora [13], we gave the necessary and sufficient conditions for which noncrossing convex bodies in the plane are in convex position. As a corollary, we improved the previous known bounds on the Erdős-Szekeres theorem in the context of convex bodies. In joint work with Fox, Pach, and Sudakov [8], we further improved these bounds and established new Ramsey-type results for monotone paths in ordered hypergraphs. In what follows I will describe each of these areas and discuss my future research goals. 2 Extremal type results 2.1 Topological graphs A topological graph is a graph drawn in the plane with vertices represented as points and edges drawn by non-self-intersecting curves connecting the corresponding points. We say that a topological graph is simple if any pair of its edges have at most one point in common. Given a simple topological graph G = (V, E), edges e 1, e 2 E(G) cross if they have a point in common (other than their 1
2 endpoints), and they are said to be disjoint if they have no points in common. In joint work with Ackerman, Fox, and Pach [2], we obtained several extremal results on topological graphs not containing a natural (k, l)-grid, that is, a set of k pairwise disjoint edges that all cross another set of l pairwise disjoint edges. Theorem 2.1. (Ackerman, Fox, Pach, Suk) Every n-vertex simple topological graph with no natural (2, 1)-grid has at most O(n) edges. Theorem 2.2. (Ackerman, Fox, Pach, Suk) Every n-vertex simple topological graph with no natural (k, k)-grid has at most O(k 2 n log 4k 6 n) edges. As a corollary to Theorem 2.1, all simple topological graphs not containing a natural (2, 1)-grid has bounded chromatic number and a linear size independent set. Future research. I intend to continue studying extremal problems in topological graph theory. One of the main tools used in the proof of Theorem 2.2 is the following theorem from [9]. Theorem 2.3. (Fox, Pach, Tóth) Let C be a collection of n curves in the plane such that each pair of curves intersect at most once. If there are ɛn 2 pairs of curves that intersect, then there exists two subfamilies S 1, S 2 C of curves such that S 1, S 2 δn and every curve in S 1 intersects every curve in S 2 where δ depends only on ɛ. Hence if G has many crossing edges, then one can use Theorem 2.3 to conclude that there are two large sets of edges that all cross each other. Therefore the main difficulty in bounding the number of edges in a simple topological graph with no natural (k, k)-grid (or no k pairwise crossing edges), is the case when there are very few crossing edges. To handle this case, I intend to study the following conjecture. Conjecture 2.4. Let C be a collection of n curves in the plane such that each pair of curves intersect at most once. If there are ɛn 2 pairs of curves that are disjoint, then there exists two subfamilies S 1, S 2 C of curves such that S 1, S 2 δn and every curve in S 1 is disjoint to every curve in S 2 where δ depends only on ɛ. Note that if two curves can cross an arbitrary number of times, there is a simple construction of n curves in the plane with n 2 /8 disjoint pairs, but does not contain two large subfamilies disjoint from each other. If conjecture 2.4 were true, then it would be a powerful tool in proving many extremal problems in topological graph theory. 2.2 Tangencies between convex bodies Two convex sets in the plane are tangent to each other if they have precisely one point in common and their interiors are disjoint. It is was first observed by Tamaki and Tokuyama [22] that in order to obtain an upper bound on the number of incidences between a family of curves C and a set of points in the plane, one must compute the number of tangencies between the members of C. I have studied the structure of tangencies between two families of closed Jordan regions, each consisting of n pairwise disjoint members. It was shown by Pinchasi and Ben-Dan [6], who independently raised the same question, that the maximum number of such tangencies is O(n 3/2 log n). Their proof is based on a theorem of Marcus-Tardos [14] and Pinchasi-Radoičić [19]. They suspected that the correct order of magnitude of the maximum is linear in n. In joint work with Pach and Treml [15], 2
3 we show that this is not true even for x-monotone curves. However we do show that it is linear in n when both families consist of convex regions (convex bodies). Theorem 2.5. (Pach, Suk, Treml) The number of tangencies between two families of convex bodies in the plane, each consisting of n > 2 disjoint members, cannot exceed 8n 16. Let C be a family of n convex sets in the plane. Suppose that C can be decomposed into k subfamilies, each consisting of pairwise disjoint bodies. Applying Theorem 2.5 to each pair of these subfamilies separately and adding up the relevant bounds, we obtain the following corollary. Corollary 2.6. Let C be a family of n convex bodies in the plane, which can be decomposed into k subfamilies consisting of disjoint regions. Then the total number of tangencies between members of C is O(kn). This bound is tight up to a multiplicative constant. Future research. In [15], we conjectured the following. Conjecture 2.7. For every fixed integer k > 2, the number of tangencies in any n-member family of convex bodies, no k of which are pairwise intersecting, is at most O k (n). Very recently Ackerman settled the conjecture for k = 3 [1], by slightly modifying the proof of Theorem 2.5. I intend to extend his discharging technique to settle the case when k = 4. For larger values of k, I plan to study the problem on bounding the chromatic number of an intersection graph of convex sets in the plane. Given a collection of convex sets C, the intersection graph G(C) is a graph with vertex set C and two vertices are adjacent if their corresponding sets intersect. It has been conjectured that the chromatic number of such graphs is bounded by some function of its clique number. 3 Ramsey type problems 3.1 Convex bodies and ordered hypergraphs The classic 1935 paper of Erdős and Szekeres [7] published in Compositio Mathematica was one of the original results that let to a very rich discipline within combinatorics: Ramsey theory (see, e.g., [12]). The main result of their paper states the following. Theorem 3.1. For any positive integer n, let ES(n) denote the smallest number such that any set of ES(n) points in the plane such that no three are collinear contains n members in convex position. Then ( ) 2n 4 2 n ES(n) + 1 = O(4 n / n). n 2 Erdős and Szekeres conjectured that ES(n) = 2 n for every integer n. Currently the best known upper bound on ES(n) is ( ) 2n 5 n 2 +1 obtained by Tóth and Valtr [23]. Bisztriczky and Fejes- Tóth [4] later generalized the Erdős-Szekeres theorem to families of convex bodies in the plane [5]. A family C of convex bodies (compact convex sets) in the plane is said to be in convex position if none of its members is contained in the convex hull of the union of the others. We say that C is in general position if every three members of C are in convex position. 3
4 Bisztriczky and Fejes-Tóth showed that there exists a function D(n) such that every family of D(n) pairwise disjoint convex sets in general position contains n members in convex position. In [17], the Bisztriczky-Fejes Tóth theorem was extended to families of noncrossing convex bodies, that is, to convex bodies, no pair of which share more than two boundary points. It was proved that there exists a function N = N(n) such that from every family of N noncrossing convex bodies in general position in the plane one can select n members in convex position. In joint work with Hubard, Montejano, and Mora [13], we generalized the definition of order type to a family of convex bodies. Given a family C of noncrossing convex sets, we say that the ordered triple (A, B, C) C has a clockwise (counterclockwise) orientation if there are three points a A, b B, c C on the boundary of conv(a B C) that follow each other in clockwise (counterclockwise) order. Note that a triple (A, B, C) may have both orientations. See Figure 1. B B B A C A C C A (a) (A, B, C) with a clockwise orientation. (b) (A, B, C) with a counterclockwise orientation. Figure 1. (c) (A, B, C) with both a clockwise and a counterclockwise orientation. The order type of C is the mapping assigning each triple (A, B, C) C the orientation of that triple. The order type of a point set was introduced by Goodman and Pollack [10] in the early eighties, and has played a significant role in geometric transversal theory [24]. The main result in our paper was the following. Theorem 3.2. (Hubard, Montejano, Mora, Suk) A family of noncrossing convex bodies is in convex position if and only if there exists an ordering of the family such that every triple is oriented clockwise. As a corollary, we improved the previous known bounds on D(n) and N(n). ( (2n 5 ) ) (2n 4 ) Corollary 3.3. (Hubard, Montejano, Mora, Suk) D(n) + 1 n Corollary 3.4. (Hubard, Montejano, Mora, Suk) There exists a constant c such that N(n) 2 2cn. Inspired by Theorem 3.2, Hubard and Montejano asked if the order type of every family of convex bodies in the plane can be represented by a point set. This was answered in the negative by Pach and Tóth in the following Theorem Theorem 3.5. (Pach and Tóth [18] and Suk [20]) Let r(n) denote the largest integer such that every family C of n pairwise disjoint segments in the plane in general position has r(n) members whose order type can be represented by points. Then there exists an absolute constant c such that cn 1/4 < r(n) < n log 8/ log 9. n 2 4
5 In joint work with Fox, Pach, and Sukakov [8], we further improved the bound on N(n). Theorem 3.6. (Fox, Pach, Sudakov, Suk) N(n) 2 cn2 log n, where c is an absolute constant. One of the main tools we used in the proof of Theorem 3.6 was a Ramsey-type result on ordered hypergraphs. Let K k (N) denote the complete k-uniform hypergraph, consisting of all k-element subsets (k-tuples) of the vertex set [N] = {1, 2,..., N}. For any n positive integers, j 1 < j 2 < < j n, we say that the hyperedges {j i, j i+1,..., j i+k 1 }, i = 1, 2,..., n k + 1, form a monotone (tight) path of length n. Let N k (q, n) denote the smallest integer N such that for every q-coloring of the hyperedges (k-tuples) of K k (N), there exists a monotone path of length n such that all of its hyperedges are of the same color. Using this notation for graphs (k = 2), Dilworth s theorem can be rephrased as N 2 (q, n) = (n 1) q +1. For 3-uniform hypergraphs, a straightforward generalization of the cup-cap argument of Erdős and Szekeres [7] gives N 3 (2, n) = ( ) 2n 4 n For more (but fixed number) of colors, in [8] we proved that lower and upper bounds are tight apart from a logarithmic factor in the exponent. Theorem 3.7. (Fox, Pach, Sudakov, Suk) We have 2 (n/q)q 1 N 3 (q, n) n nq 1. Define the tower function t i (x) by t 1 (x) = x and t i+1 (x) = 2 t i(x). Using a stepping up approach, we also showed the following extension. Theorem 3.8. (Fox, Pach, Sudakov, Suk) For each k 3 and q there are constants c, c (depending only on k and q) such that t k 1 (cn q 1 ) N k (n, q) t k 1 (c n q 1 log n). As a geometric application, we proved that N(n) N 3 (3, n) 2 cn2 log n. Future research. I intend to continue studying the function N k (q, n). We plan to derive better upper bounds on N k (q, n) by modifying the proof of Theorem 3.8 and using more modern probabilistic methods. Furthermore, we plan to explore the other Ramsey-type functions described in [8] as well as developing density-type theorems for ordered hypergraphs. One of our main goals is to show that D(n) = N(n) = ES(n). 5
6 References [1] Ackerman, E.: personal communication, [2] Ackerman, E., Fox, J., Pach, J., and Suk. A.: On grids in topological graphs. In Proceedings of the 25th Annual Symposium on Computational Geometry (Aarhus, Denmark, June 08-10, 2009). SCG 09. ACM, New York, NY, , [3] Agarwal, P.K., Pach, J., and Sharir, M.: State of the union (of geometric objects), in: Surveys on Discrete and Computational Geometry, Contemp. Math. 453, Amer. Math. Soc., Providence, RI, 2008, [4] Bisztriczky, T., Fejes Tóth, G.: A generalization of the Erdős-Szekeres convex n-gon theorem, Journal für die reine und angewandte Mathematik 395 (1989), [5] Bisztriczky, T., Fejes Tóth, G.: Convexly independent sets, Combinatorica 10 (1990), [6] Ben-Dan, I. and Pinchasi, R.: personal communication, November [7] Erdős, P., Szekeres, G.: A combinatorial problem in geometry. Compositio Math. 2, (1935) [8] Fox, J., Pach, J., Sudakov, B., Suk, A.: Erdős-Szekeres-type theorems for monotone paths and convex bodies, manuscript, [9] Fox, J., Pach, J., and Tóth, Cs. D. : Intersection patterns of curves. Journal of the London Mathematical Society (to appear). [10] Goodman, J. E. and Pollack, R.: On the cambinatorial classification of nondegenerate configurations in the plane, J. Combinatorial Theory Ser. A 29 (1982) [11] Green, B., Tao, T.: The primes contain arbitrarily long arithmetic progressions. Annals of Math. 167 (2008), [12] Graham, R. L., Rothschild, B. L., Spencer, J. H.: Ramsey Theory, 2nd ed., Wiley, New York, [13] Hubard, A., Montejano, L., Mora, E., Suk, A.: Order types of convex bodies, Order, DOI: /s [14] Marcus, A. and Tardos, G.: Intersection reverse sequences and geometric applications, J. Combin. Theory Ser. A 113 (2006), [15] Pach, J., Suk, A., and Treml, M.: Tangencies between families of disjoint regions in the plane. In Proceedings of the 2010 Annual Symposium on Computational Geometry (Snowbird, Utah, USA, June 13-16, 2010). SoCG 10. ACM, New York, NY, , [16] Pach, J., Tóth, G.: A generalization of the Erdős-Szekeres theorem to disjoint convex sets, Discrete and Computational Geometry 19 (1998),
7 [17] Pach, J., Tóth, G.: Erdős-Szekeres-type theorems for segments and noncrossing convex sets, Geometriae Dedicata 81 (2000), [18] Pach, J., Tóth, G.: Families of convex sets not representable by points, Indian Statistical Institute Platinum Jubilee Commemorative Volume Architecture and Algorithms, World Scientific, Singapore, 2009, [19] Pinchasi, R. and Radoičić, R.: On the number of edges in geometric graphs with no selfintersecting cycle of length 4, in: Towards a Theory of Geometric Graphs, Contemporary Mathematics (J. Pach, ed.), 342, American Mathematical Society, Providence, RI, [20] Suk, A.: On the order types of system of segments in the plane, Order 27 (2010), [21] Szemerédi, E.: On sets of integers containing no k elements in arithmetic progression, Acta Arithmetica 27 (1975), [22] Tamaki, H., Tokuyama, T.: How to cut pseudoparabolas into segments, Discrete Comput. Geom. 19 (1998), no. 2, [23] Tóth, G., Valtr, P.: The Erdős-Szekeres theorem, upper bounds and generalizations, Discrete and Computational Geometry - Papers from the MSRI Special Program (J. E. Goodman et al. eds.), MSRI Publications 52 Cambridge University Press, Cambridge (2005), [24] Wenger, R.: Progress in geometric transversal theory. In: Chazelle, B., Goodman, J. E., Pollack, R. (eds.) Advances in Discrete and Computational Geometry, Contemp. Math., 223, pp Amer. Math. Soc. (1999) 7
Tangencies between families of disjoint regions in the plane
Tangencies between families of disjoint regions in the plane János Pach Andrew Suk Miroslav Treml March 24, 2010 Abstract Let C be a family of n convex bodies in the plane, which can be decomposed into
More informationUniversity of Illinois at Chicago Office: SEO 521 Department of Mathematics, Statistics, (312) 413-2605 and Computer Science
Andrew Suk Contact Information Research Interests Employment University of Illinois at Chicago Office: SEO 521 Department of Mathematics, Statistics, (312) 413-2605 and Computer Science suk@math.uic.edu
More informationThe minimum number of distinct areas of triangles determined by a set of n points in the plane
The minimum number of distinct areas of triangles determined by a set of n points in the plane Rom Pinchasi Israel Institute of Technology, Technion 1 August 6, 007 Abstract We prove a conjecture of Erdős,
More informationOn an anti-ramsey type result
On an anti-ramsey type result Noga Alon, Hanno Lefmann and Vojtĕch Rödl Abstract We consider anti-ramsey type results. For a given coloring of the k-element subsets of an n-element set X, where two k-element
More informationarxiv:1209.1595v5 [math.co] 26 Dec 2014
TRIANGLE-FREE INTERSECTION GRAPHS OF LINE SEGMENTS WITH LARGE CHROMATIC NUMBER ARKADIUSZ PAWLIK, JAKUB KOZIK, TOMASZ KRAWCZYK, MICHAŁ LASOŃ, PIOTR MICEK, WILLIAM T. TROTTER, AND BARTOSZ WALCZAK arxiv:1209.1595v5
More informationOn Grids in Topological Graphs
On Grids in Topological Graphs Eyal Ackerman Jacob Fox János Pach Andrew Suk Abstract A topological graph is a graph drawn in the plane with vertices represented by points and edges as arcs connecting
More informationRemoving 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 informationThe degree, size and chromatic index of a uniform hypergraph
The degree, size and chromatic index of a uniform hypergraph Noga Alon Jeong Han Kim Abstract Let H be a k-uniform hypergraph in which no two edges share more than t common vertices, and let D denote the
More informationThe number of generalized balanced lines
The number of generalized balanced lines David Orden Pedro Ramos Gelasio Salazar Abstract Let S be a set of r red points and b = r + 2δ blue points in general position in the plane, with δ 0. A line l
More informationarxiv:1203.1525v1 [math.co] 7 Mar 2012
Constructing subset partition graphs with strong adjacency and end-point count properties Nicolai Hähnle haehnle@math.tu-berlin.de arxiv:1203.1525v1 [math.co] 7 Mar 2012 March 8, 2012 Abstract Kim defined
More informationCollinear 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,
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 informationON SELF-INTERSECTIONS OF IMMERSED SURFACES
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 126, Number 12, December 1998, Pages 3721 3726 S 0002-9939(98)04456-6 ON SELF-INTERSECTIONS OF IMMERSED SURFACES GUI-SONG LI (Communicated by Ronald
More informationShortcut sets for plane Euclidean networks (Extended abstract) 1
Shortcut sets for plane Euclidean networks (Extended abstract) 1 J. Cáceres a D. Garijo b A. González b A. Márquez b M. L. Puertas a P. Ribeiro c a Departamento de Matemáticas, Universidad de Almería,
More informationTriangulation by Ear Clipping
Triangulation by Ear Clipping David Eberly Geometric Tools, LLC http://www.geometrictools.com/ Copyright c 1998-2016. All Rights Reserved. Created: November 18, 2002 Last Modified: August 16, 2015 Contents
More informationStrong Ramsey Games: Drawing on an infinite board
Strong Ramsey Games: Drawing on an infinite board Dan Hefetz Christopher Kusch Lothar Narins Alexey Pokrovskiy Clément Requilé Amir Sarid arxiv:1605.05443v2 [math.co] 25 May 2016 May 26, 2016 Abstract
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 informationArrangements And Duality
Arrangements And Duality 3.1 Introduction 3 Point configurations are tbe most basic structure we study in computational geometry. But what about configurations of more complicated shapes? For example,
More informationComputational Geometry. Lecture 1: Introduction and Convex Hulls
Lecture 1: Introduction and convex hulls 1 Geometry: points, lines,... Plane (two-dimensional), R 2 Space (three-dimensional), R 3 Space (higher-dimensional), R d A point in the plane, 3-dimensional space,
More informationStudia Scientiarum Mathematicarum Hungarica 41 (2), 243 266 (2004)
Studia Scientiarum Mathematicarum Hungarica 4 (), 43 66 (004) PLANAR POINT SETS WITH A SMALL NUMBER OF EMPTY CONVEX POLYGONS I. BÁRÁNY and P. VALTR Communicated by G. Fejes Tóth Abstract A subset A of
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 information1 September 7: Intro to Ramsey Numbers
Davie Rolnick 1 SEPTEMBER 7: INTRO TO RAMSEY NUMBERS 1 September 7: Intro to Ramsey Numbers Summary: Complete disorder is impossible. More explicitly, any very large system contains a subsystem which is
More informationMean 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
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 Haifa-ORANIM, Tivon 36006, Israel. AMS Subject Classification:
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 informationPh.D. Thesis. Judit Nagy-György. Supervisor: Péter Hajnal Associate Professor
Online algorithms for combinatorial problems Ph.D. Thesis by Judit Nagy-György Supervisor: Péter Hajnal Associate Professor Doctoral School in Mathematics and Computer Science University of Szeged Bolyai
More informationHigh degree graphs contain large-star factors
High degree graphs contain large-star 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 informationERDOS PROBLEMS ON IRREGULARITIES OF LINE SIZES AND POINT DEGREES A. GYARFAS*
BOLYAI SOCIETY MATHEMATICAL STUDIES, 11 Paul Erdos and his Mathematics. II, Budapest, 2002, pp. 367-373. ERDOS PROBLEMS ON IRREGULARITIES OF LINE SIZES AND POINT DEGREES A. GYARFAS* Problems and results
More informationDensity and regularity theorems for semi-algebraic hypergraphs
Density and regularity theorems for semi-algebraic hypergraphs Jacob Fox János Pach Andrew Suk October 3, 2014 Abstract A k-uniform semi-algebraic hypergraph H is a pair (P, E), where P is a subset of
More information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More informationINCIDENCE-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
More informationSolving Geometric Problems with the Rotating Calipers *
Solving Geometric Problems with the Rotating Calipers * Godfried Toussaint School of Computer Science McGill University Montreal, Quebec, Canada ABSTRACT Shamos [1] recently showed that the diameter of
More informationEmbedding nearly-spanning bounded degree trees
Embedding nearly-spanning bounded degree trees Noga Alon Michael Krivelevich Benny Sudakov Abstract We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of
More informationDisjoint Compatible Geometric Matchings
Disjoint Compatible Geometric Matchings Mashhood Ishaque Diane L. Souvaine Csaba D. Tóth Abstract We prove that for every even set of n pairwise disjoint line segments in the plane in general position,
More informationCycles 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
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 informationProduct 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
More informationTotal colorings of planar graphs with small maximum degree
Total colorings of planar graphs with small maximum degree Bing Wang 1,, Jian-Liang Wu, Si-Feng Tian 1 Department of Mathematics, Zaozhuang University, Shandong, 77160, China School of Mathematics, Shandong
More informationInduced subgraphs of Ramsey graphs with many distinct degrees
Journal of Combinatorial Theory, Series B 97 (2007) 62 69 www.elsevier.com/locate/jctb Induced subgraphs of Ramsey graphs with many distinct degrees Boris Bukh a, Benny Sudakov a,b a Department of Mathematics,
More informationBest Monotone Degree Bounds for Various Graph Parameters
Best Monotone Degree Bounds for Various Graph Parameters D. Bauer Department of Mathematical Sciences Stevens Institute of Technology Hoboken, NJ 07030 S. L. Hakimi Department of Electrical and Computer
More informationCHAPTER 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.
More informationM-Degrees of Quadrangle-Free Planar Graphs
M-Degrees of Quadrangle-Free Planar Graphs Oleg V. Borodin, 1 Alexandr V. Kostochka, 1,2 Naeem N. Sheikh, 2 and Gexin Yu 3 1 SOBOLEV INSTITUTE OF MATHEMATICS NOVOSIBIRSK 630090, RUSSIA E-mail: brdnoleg@math.nsc.ru
More informationFinding and counting given length cycles
Finding and counting given length cycles Noga Alon Raphael Yuster Uri Zwick Abstract We present an assortment of methods for finding and counting simple cycles of a given length in directed and undirected
More informationA NOTE ON OFF-DIAGONAL SMALL ON-LINE RAMSEY NUMBERS FOR PATHS
A NOTE ON OFF-DIAGONAL SMALL ON-LINE RAMSEY NUMBERS FOR PATHS PAWE L PRA LAT Abstract. In this note we consider the on-line Ramsey numbers R(P n, P m ) for paths. Using a high performance computing clusters,
More informationOn-line Ramsey numbers
On-line Ramsey numbers David Conlon Abstract Consider the following game between two players, Builder and Painter Builder draws edges one at a time and Painter colours them, in either red or blue, as each
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 informationABSTRACT. For example, circle orders are the containment orders of circles (actually disks) in the plane (see [8,9]).
Degrees of Freedom Versus Dimension for Containment Orders Noga Alon 1 Department of Mathematics Tel Aviv University Ramat Aviv 69978, Israel Edward R. Scheinerman 2 Department of Mathematical Sciences
More informationPRIME FACTORS OF CONSECUTIVE INTEGERS
PRIME FACTORS OF CONSECUTIVE INTEGERS MARK BAUER AND MICHAEL A. BENNETT Abstract. This note contains a new algorithm for computing a function f(k) introduced by Erdős to measure the minimal gap size in
More informationTopological Treatment of Platonic, Archimedean, and Related Polyhedra
Forum Geometricorum Volume 15 (015) 43 51. FORUM GEOM ISSN 1534-1178 Topological Treatment of Platonic, Archimedean, and Related Polyhedra Tom M. Apostol and Mamikon A. Mnatsakanian Abstract. Platonic
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 informationMinimum degree condition forcing complete graph immersion
Minimum degree condition forcing complete graph immersion Matt DeVos Department of Mathematics Simon Fraser University Burnaby, B.C. V5A 1S6 Jacob Fox Department of Mathematics MIT Cambridge, MA 02139
More informationClique coloring B 1 -EPG graphs
Clique coloring B 1 -EPG graphs Flavia Bonomo a,c, María Pía Mazzoleni b,c, and Maya Stein d a Departamento de Computación, FCEN-UBA, Buenos Aires, Argentina. b Departamento de Matemática, FCE-UNLP, La
More informationGame Chromatic Index of Graphs with Given Restrictions on Degrees
Game Chromatic Index of Graphs with Given Restrictions on Degrees Andrew Beveridge Department of Mathematics and Computer Science Macalester College St. Paul, MN 55105 Tom Bohman, Alan Frieze, and Oleg
More informationCompetitive Analysis of On line Randomized Call Control in Cellular Networks
Competitive Analysis of On line Randomized Call Control in Cellular Networks Ioannis Caragiannis Christos Kaklamanis Evi Papaioannou Abstract In this paper we address an important communication issue arising
More informationOn the crossing number of K m,n
On the crossing number of K m,n Nagi H. Nahas nnahas@acm.org Submitted: Mar 15, 001; Accepted: Aug 10, 00; Published: Aug 1, 00 MR Subject Classifications: 05C10, 05C5 Abstract The best lower bound known
More informationCS311H. Prof: Peter Stone. Department of Computer Science The University of Texas at Austin
CS311H Prof: Department of Computer Science The University of Texas at Austin Good Morning, Colleagues Good Morning, Colleagues Are there any questions? Logistics Class survey Logistics Class survey Homework
More informationShortest Inspection-Path. Queries in Simple Polygons
Shortest Inspection-Path Queries in Simple Polygons Christian Knauer, Günter Rote B 05-05 April 2005 Shortest Inspection-Path Queries in Simple Polygons Christian Knauer, Günter Rote Institut für Informatik,
More informationOn three zero-sum Ramsey-type problems
On three zero-sum Ramsey-type 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 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 information1. Prove that the empty set is a subset of every set.
1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since
More informationMax-Min Representation of Piecewise Linear Functions
Beiträge zur Algebra und Geometrie Contributions to Algebra and Geometry Volume 43 (2002), No. 1, 297-302. Max-Min Representation of Piecewise Linear Functions Sergei Ovchinnikov Mathematics Department,
More informationThe Independence Number in Graphs of Maximum Degree Three
The Independence Number in Graphs of Maximum Degree Three Jochen Harant 1 Michael A. Henning 2 Dieter Rautenbach 1 and Ingo Schiermeyer 3 1 Institut für Mathematik, TU Ilmenau, Postfach 100565, D-98684
More informationNo: 10 04. Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics
No: 10 04 Bilkent University Monotonic Extension Farhad Husseinov Discussion Papers Department of Economics The Discussion Papers of the Department of Economics are intended to make the initial results
More informationStationary 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
More informationBinary Space Partitions
Title: Binary Space Partitions Name: Adrian Dumitrescu 1, Csaba D. Tóth 2,3 Affil./Addr. 1: Computer Science, Univ. of Wisconsin Milwaukee, Milwaukee, WI, USA Affil./Addr. 2: Mathematics, California State
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 informationDiffuse Reflection Radius in a Simple Polygon
Diffuse Reflection Radius in a Simple olygon Eli Fox-Epstein Csaba D. Tóth Andrew Winslow arxiv:1402.5303v3 [cs.cg] 17 May 2015 Abstract It is shown that every simple polygon in general position with n
More informationON COMPUTATIONAL COMPLEXITY OF PLANE CURVE INVARIANTS
ON COMPUTATIONAL COMPLEXITY OF PLANE CURVE INVARIANTS FEDOR DUZHIN AND TAO BIAOSHUAI ABSTRACT. The theory of generic smooth closed plane curves initiated by Vladimir Arnold is a beautiful fusion of topology,
More informationTilings of the sphere with right triangles III: the asymptotically obtuse families
Tilings of the sphere with right triangles III: the asymptotically obtuse families Robert J. MacG. Dawson Department of Mathematics and Computing Science Saint Mary s University Halifax, Nova Scotia, Canada
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 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 informationBalloons, Cut-Edges, Matchings, and Total Domination in Regular Graphs of Odd Degree
Balloons, Cut-Edges, Matchings, and Total Domination in Regular Graphs of Odd Degree Suil O, Douglas B. West November 9, 2008; revised June 2, 2009 Abstract A balloon in a graph G is a maximal 2-edge-connected
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É CLAUDE-BERNARD LYON 1 69622 VILLEURBANNE, FRANCE 2 DEPARTMENT OF MATHEMATICS
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 informationStrictly Localized Construction of Planar Bounded-Degree Spanners of Unit Disk Graphs
Strictly Localized Construction of Planar Bounded-Degree Spanners of Unit Disk Graphs Iyad A. Kanj Ljubomir Perković Ge Xia Abstract We describe a new distributed and strictly-localized approach for constructing
More informationCatalan Numbers. Thomas A. Dowling, Department of Mathematics, Ohio State Uni- versity.
7 Catalan Numbers Thomas A. Dowling, Department of Mathematics, Ohio State Uni- Author: versity. Prerequisites: The prerequisites for this chapter are recursive definitions, basic counting principles,
More informationDegree 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
More informationINDISTINGUISHABILITY 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
More informationA Note on Maximum Independent Sets in Rectangle Intersection Graphs
A Note on Maximum Independent Sets in Rectangle Intersection Graphs Timothy M. Chan School of Computer Science University of Waterloo Waterloo, Ontario N2L 3G1, Canada tmchan@uwaterloo.ca September 12,
More informationLecture 22: November 10
CS271 Randomness & Computation Fall 2011 Lecture 22: November 10 Lecturer: Alistair Sinclair Based on scribe notes by Rafael Frongillo Disclaimer: These notes have not been subjected to the usual scrutiny
More informationCMSC 858T: Randomized Algorithms Spring 2003 Handout 8: The Local Lemma
CMSC 858T: Randomized Algorithms Spring 2003 Handout 8: The Local Lemma Please Note: The references at the end are given for extra reading if you are interested in exploring these ideas further. You are
More informationDefinition 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
More informationTesting Hereditary Properties of Non-Expanding Bounded-Degree Graphs
Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs Artur Czumaj Asaf Shapira Christian Sohler Abstract We study graph properties which are testable for bounded degree graphs in time independent
More informationAN ALGORITHM FOR DETERMINING WHETHER A GIVEN BINARY MATROID IS GRAPHIC
AN ALGORITHM FOR DETERMINING WHETHER A GIVEN BINARY MATROID IS GRAPHIC W. T. TUTTE. Introduction. In a recent series of papers [l-4] on graphs and matroids I used definitions equivalent to the following.
More informationThe sum of digits of polynomial values in arithmetic progressions
The sum of digits of polynomial values in arithmetic progressions Thomas Stoll Institut de Mathématiques de Luminy, Université de la Méditerranée, 13288 Marseille Cedex 9, France E-mail: stoll@iml.univ-mrs.fr
More informationMinimum Bisection is NP-hard on Unit Disk Graphs
Minimum Bisection is NP-hard on Unit Disk Graphs Josep Díaz 1 and George B. Mertzios 2 1 Departament de Llenguatges i Sistemes Informátics, Universitat Politécnica de Catalunya, Spain. 2 School of Engineering
More informationMATHEMATICAL INDUCTION. Mathematical Induction. This is a powerful method to prove properties of positive integers.
MATHEMATICAL INDUCTION MIGUEL A LERMA (Last updated: February 8, 003) Mathematical Induction This is a powerful method to prove properties of positive integers Principle of Mathematical Induction Let P
More informationGeometry: Unit 1 Vocabulary TERM DEFINITION GEOMETRIC FIGURE. Cannot be defined by using other figures.
Geometry: Unit 1 Vocabulary 1.1 Undefined terms Cannot be defined by using other figures. Point A specific location. It has no dimension and is represented by a dot. Line Plane A connected straight path.
More informationVERTICES OF GIVEN DEGREE IN SERIES-PARALLEL GRAPHS
VERTICES OF GIVEN DEGREE IN SERIES-PARALLEL GRAPHS MICHAEL DRMOTA, OMER GIMENEZ, AND MARC NOY Abstract. We show that the number of vertices of a given degree k in several kinds of series-parallel labelled
More informationFiber sums of genus 2 Lefschetz fibrations
Proceedings of 9 th Gökova Geometry-Topology Conference, pp, 1 10 Fiber sums of genus 2 Lefschetz fibrations Denis Auroux Abstract. Using the recent results of Siebert and Tian about the holomorphicity
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 informationMulti-layer Structure of Data Center Based on Steiner Triple System
Journal of Computational Information Systems 9: 11 (2013) 4371 4378 Available at http://www.jofcis.com Multi-layer Structure of Data Center Based on Steiner Triple System Jianfei ZHANG 1, Zhiyi FANG 1,
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 long-standing
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 informationIncidence Theorems and Their Applications
Incidence Theorems and Their Applications Zeev Dvir 1 1 Princeton university, Mathematics and Computer Science Departments. Princeton, NJ, 08540. zdvir@princeton.edu. Abstract We survey recent (and not
More informationDuality of linear conic problems
Duality of linear conic problems Alexander Shapiro and Arkadi Nemirovski Abstract It is well known that the optimal values of a linear programming problem and its dual are equal to each other if at least
More informationAn 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
More informationFairness in Routing and Load Balancing
Fairness in Routing and Load Balancing Jon Kleinberg Yuval Rabani Éva Tardos Abstract We consider the issue of network routing subject to explicit fairness conditions. The optimization of fairness criteria
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 informationUPPER BOUNDS ON THE L(2, 1)-LABELING NUMBER OF GRAPHS WITH MAXIMUM DEGREE
UPPER BOUNDS ON THE L(2, 1)-LABELING NUMBER OF GRAPHS WITH MAXIMUM DEGREE ANDREW LUM ADVISOR: DAVID GUICHARD ABSTRACT. L(2,1)-labeling was first defined by Jerrold Griggs [Gr, 1992] as a way to use graphs
More information