LIST OF PUBLICATIONS OF GYULA KÁROLYI

Size: px
Start display at page:

Download "LIST OF PUBLICATIONS OF GYULA KÁROLYI"

Transcription

1 LIST OF PUBLICATIONS OF GYULA KÁROLYI I Research papers [1] Doubly transitive permutation groups with abelian stabilizers (with S.J. Kovács and P.P. Pálfy), Aequationes Mathematicae 39 (1990) [2] On point covers of parallel rectangles, Periodica Mathematica Hungarica 23 (1991) [3] A note on the path-discrepancy of trees (with I. Bárány), Studia Scientiarum Mathematicarum Hungarica 30 (1995) [4] Geometric discrepancy theorems in higher dimensions, Studia Scientiarum Mathematicarum Hungarica 30 (1995) [5] Irregularities of point distributions relative to homothetic convex bodies. I, Monatshefte für Mathematik 120 (1995) [6] On point covers of multiple intervals and axis-parallel rectangles (with G. Tardos), Combinatorica 16 (1996) [7] Ramsey-type results for geometric graphs. I (with J. Pach and G. Tóth), Discrete and Computational Geometry 18 (1997) [8] An algorithm for finding many disjoint monochromatic edges in a complete 2-colored geometric graph (with J. Pach, G. Tardos and G. Tóth), in: Intuitive Geometry (I. Bárány and K. Böröczky, eds.), Bolyai Soc. Math. Studies 6, J. Bolyai Math. Society, Budapest (1997) pp [9] Ramsey-type results for geometric graphs. II (with J. Pach, G. Tóth, and P. Valtr), Discrete and Computational Geometry 20 (1998) [10] On a graph colouring problem (with M. Cochand), Discrete Mathematics 194 (1999) [11] An Erdős-Szekeres type problem in the plane (with G. Tóth), Periodica Mathematica Hungarica 39 (1999) [12] Subpolytopes of cyclic polytopes (with T. Bisztriczky), European Journal of Combinatorics 21 (2000)

2 [13] Ramsey-remainder for convex sets and the Erdős-Szekeres theorem, Discrete Applied Mathematics 109 (2001) [14] A modular version of the Erdős-Szekeres theorem (with J. Pach and G. Tóth), Studia Scientiarum Mathematicarum Hungarica 38 (2001) [15] Generalized and geometric Ramsey numbers for cycles (with V. Rosta), Theoretical Computer Science 263 (2001) [16] Problems and results around the Erdős Szekeres convex polygon theorem (with I. Bárány), in: Discrete and Computational Geometry (J. Akiyama, M. Kano, and M. Urabe, eds.), Lecture Notes in Computer Science 2098, Springer, Berlin (2001) pp [17] Towards a Katona type proof for the 2-intersecting Erdős-Ko-Rado theorem (with R. Howard and L.A. Székely), Electronic Journal of Combinatorics 8(1) (2001) Research paper R31, 8 pages (electronic). [18] Crossing-free segments and triangles in point configurations (with E. Welzl), Discrete Applied Mathematics 115 (2001) [19] Transversals of additive latin squares (with S. Dasgupta, O. Serra, and B. Szegedy), Israel Journal of Mathematics 126 (2001) [20] Almost disjoint triangles in 3-space (with J. Solymosi), Discrete and Computational Geometry 28 (2002) [21] On the existence of a convex polygon with a specified number of interior points (with K. Hosono and M. Urabe), in: Discrete Geometry (A. Bezdek, ed.), Monographs and Textbooks in Pure and Applied Mathematics 253, Marcel Dekker, New York (2003) pp [22] A Turán-type extremal theory of convex geometric graphs (with P. Brass and P. Valtr), in: Discrete and Computational Geometry (B. Aronov et al., eds.), Algorithms and Combinatorics 25, Springer, Berlin (2003) pp [23] Point configurations in d-space without large subsets in convex position (with P. Valtr), Discrete and Computational Geometry 30 (2003) [24] Chromatic variants of the Erdős Szekeres theorem on points in convex position (with O. Devillers, F. Hurtado, and C. Seara), Computational Geometry Theory and Applications 26 (2003) [25] On restricted set addition in abelian groups, Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae. Sectio Mathematica 46 (2003)

3 [26] The Erdős Heilbronn problem in abelian groups, Israel Journal of Mathematics 139 (2004) [27] Constructions from empty polygons (with T. Bisztriczky, K. Hosono and M. Urabe), Periodica Mathematica Hungarica 49 (2004) 1 8. [28] An inverse theorem for the restricted set addition in abelian groups, Journal of Algebra 290 (2005) [29] A compactness argument in the additive theory and the polynomial method, Discrete Mathematics 302 (2005) [30] Cauchy Davenport theorem in group extensions, L Enseignement Mathématique 51 (2005) [31] Erdős Szekeres theorem with forbidden order types (with J. Solymosi), Journal of Combinatorial Theory, Series A 113 (2006) [32] A note on the Hopf Stiefel function, European Journal of Combinatorics 27 (2006) [33] Empty convex polygons in almost convex sets (with G. Lippner and P. Valtr), Periodica Mathematica Hungarica 55 (2007) [34] Periodic decomposition of integer valued functions (with T. Keleti, G. Kós, and I.Z. Ruzsa), Acta Mathematica Hungarica 119 (2008) [35] Restricted set addition: The exceptional case of the Erdős Heilbronn conjecture, Journal of Combinatorial Theory A 116 (2009) [36] On geometric graph Ramsey numbers (with V. Rosta), Graphs and Combinatorics 25 (2009) [37] Balanced subset sums in dense sets of integers, Integers 9 (2009) [38] The polynomial method in additive combinatorics, in: Combinatorial Number Theory and Additive Group Theory (A. Geroldinger and I.Z. Ruzsa), Advanced Courses in Mathematics CRM Barcelona, Birkhäuser (2009) pp [39] Incidence geometry in combinatorial arithmetic. In memoriam György Elekes, Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae. Sectio Mathematica 52 (2009) [40] Remarks to Arsovski s proof of Snevily s conjecture (with G. Harcos and G. Kós), Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae. Sectio Mathematica 54 (2011)

4 [41] The cyclomatic number of connected graphs without solvable orbits (with A. Pál), Journal of the Ramanujan Mathematical Society 27 (2012) [42] Erdős Szekeres theorem for point sets with forbidden subconfigurations (with G. Tóth), Discrete and Computational Geometry 48 (2012) [43] Ramsey-type problems for geometric graphs, in: Thirty Essays on Geometric Graph Theory (J. Pach, ed.), Springer, New York (2013) pp [44] On the exterior algebra method applied to restricted set addition (with R. Paulin), European Journal of Combinatorics, to appear (10 pages). [45] A simple proof of the Zeilberger Bressoud q-dyson theorem (with Z.L. Nagy), Proceedings of the American Mathematical Society, to appear (4 pages). [46] Constant term identities and Poincaré polynomials (with A. Lascoux, and S. O. Warnaar), Transactions of the American Mathematical Society, to appear (27 pages). II Other writings [A] Tiling Euclidean n-space by discrete sets of points (in Hungarian), Student s research paper, awarded by the Students Scientific Association, Eötvös University, Budapest, [B] Methods in Discrepancy Theory (in Hungarian), Thesis for Diploma in Mathematics, Eötvös University, Budapest, [C] Tactical instructions for gangsters and detectives (in Hungarian), Mathematical and Physical Journal for Secondary Schools (KöMaL) 37 (1987) 1 9. [D] How to approximate irrational numbers (in Hungarian), Mathematical and Physical Journal for Secondary Schools (KöMaL) 38 (1988) [E] Decomposition of convex polytopes into simplices (with L. Lovász), unpublished manuscript, Budapest, See [F] Geometric Discrepancy Theorems in Higher Dimensions (in Hungarian), Ph.D. Thesis, Hungarian Academy of Sciences, Budapest, [G] Combinatorial Structures (with F. de Clerck and M.J. de Resmini), Eötvös University, Budapest, 1993 (132 pages). [H] Solution to the problems of the 1998 Kürschák Competition (in Hungarian), Mathematical and Physical Journal for Secondary Schools (KöMaL) 49 (1999)

5 [I] Solution to the problems of the 1999 Kürschák Competition (in Hungarian), Mathematical and Physical Journal for Secondary Schools (KöMaL) 50 (2000) [J] Solution to the problems of the 2000 Kürschák Competition (in Hungarian), Mathematical and Physical Journal for Secondary Schools (KöMaL) 51 (2001) [K] A Course in Graph Theory Notes of my course given at the ETH Zurich, Wintersemester See [L] Solution to the problems of the 2001 Kürschák Competition (in Hungarian), Mathematical and Physical Journal for Secondary Schools (KöMaL) 52 (2002) [M] Solution to the problems of the 2002 Kürschák Competition (in Hungarian), Mathematical and Physical Journal for Secondary Schools (KöMaL) 53 (2003) [N] Algebraic and Combinatorial Methods in the Theory of Set Addition, D.Sc. Dissertation, Hungarian Academy of Sciences, Budapest, [O] Sum and product sets. In memoriam György Elekes (in Hungarian), Matematikai Lapok, Journal of the János Bolyai Mathematical Society 15 (2009/2)

Curriculum Vitae PERSONAL INFORMATION EDUCATION, EMPLOYMENT

Curriculum Vitae PERSONAL INFORMATION EDUCATION, EMPLOYMENT Curriculum Vitae Géza Tóth PERSONAL INFORMATION Birth Date: August 12, 1968 Citizenship: Hungarian Institute/mailing address: Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences P. O.

More information

Note on the chromatic number of the space

Note on the chromatic number of the space Note on the chromatic number of the space Radoš Radoičić Géza Tóth Abstract The chromatic number of the space is the minimum number of colors needed to color the points of the space so that every two points

More information

arxiv: v2 [math.co] 27 Aug 2016

arxiv: v2 [math.co] 27 Aug 2016 On the Erdős-Szekeres convex polygon problem Andrew Suk arxiv:1604.08657v2 [math.co] 27 Aug 26 Abstract Let ES(n) be the smallest integer such that any set of ES(n) points in the plane in general position

More information

arxiv: v2 [math.mg] 17 Apr 2015

arxiv: v2 [math.mg] 17 Apr 2015 ERDŐS - SZEKERES THEOREM FOR LINES IMRE BÁRÁNY, EDGARDO ROLDÁN-PENSADO, AND GÉZA TÓTH arxiv:1307.5666v2 [math.mg] 17 Apr 2015 Abstract. According to the Erdős-Szekeres theorem, for every n, a sufficiently

More information

arxiv: v1 [math.mg] 22 Jul 2013

arxiv: v1 [math.mg] 22 Jul 2013 ERDŐS - SZEKERES THEOREM FOR LINES IMRE BÁRÁNY, EDGARDO ROLDÁN-PENSADO, AND GÉZA TÓTH arxiv:1307.5666v1 [math.mg] 22 Jul 2013 Abstract. According to the Erdős-Szekeres theorem, for every n, a sufficiently

More information

The Cauchy-Davenport Theorem for Finite Groups

The Cauchy-Davenport Theorem for Finite Groups arxiv:1202.1816v1 [math.co] 8 Feb 2012 The Cauchy-Davenport Theorem for Finite Groups Jeffrey Paul Wheeler February 2006 Abstract The Cauchy-Davenport theorem states that for any two nonempty subsetsaandb

More information

Geometry. Open Caps and Cups in Planar Point Sets. Pavel Valtr. 1. Introduction

Geometry. Open Caps and Cups in Planar Point Sets. Pavel Valtr. 1. Introduction Discrete Comput Geom 37:565 576 (2007) DOI: 10.1007/s00454-006-1286-3 Discrete & Computational Geometry 2007 Springer Science+Business Media, Inc. Open Caps and Cups in Planar Point Sets Pavel Valtr Department

More information

arxiv: v3 [math.co] 23 Jun 2008

arxiv: v3 [math.co] 23 Jun 2008 BOUNDING MULTIPLICATIVE ENERGY BY THE SUMSET arxiv:0806.1040v3 [math.co] 23 Jun 2008 Abstract. We prove that the sumset or the productset of any finite set of real numbers, A, is at least A 4/3 ε, improving

More information

Problems and Results in Additive Combinatorics

Problems and Results in Additive Combinatorics Problems and Results in Additive Combinatorics Zhi-Wei Sun Nanjing University Nanjing 210093, P. R. China zwsun@nju.edu.cn http://math.nju.edu.cn/ zwsun August 2, 2010 While in the past many of the basic

More information

ON THE INVERSE ERDŐS-HEILBRONN PROBLEM FOR RESTRICTED SET ADDITION IN FINITE GROUPS

ON THE INVERSE ERDŐS-HEILBRONN PROBLEM FOR RESTRICTED SET ADDITION IN FINITE GROUPS ON THE INVERSE ERDŐS-HEILBRONN PROBLEM FOR RESTRICTED SET ADDITION IN FINITE GROUPS Suren M. Jayasuriya Department of Electrical and Computer Engineering, Cornell University, Ithaca, New York 1453, USA

More information

TWO EXTENSIONS OF THE ERDŐS SZEKERES PROBLEM

TWO EXTENSIONS OF THE ERDŐS SZEKERES PROBLEM TWO EXTENSIONS OF THE ERDŐS SZEKERES PROBLEM ANDREAS F. HOLMSEN, HOSSEIN NASSAJIAN MOJARRAD, JÁNOS PACH, AND GÁBOR TARDOS Abstract. According to Suk s breakthrough result on the Erdős Szekeres problem,

More information

A SUM-PRODUCT ESTIMATE IN ALGEBRAIC DIVISION ALGEBRAS OVER R. Department of Mathematics University of California Riverside, CA

A SUM-PRODUCT ESTIMATE IN ALGEBRAIC DIVISION ALGEBRAS OVER R. Department of Mathematics University of California Riverside, CA A SUM-PRODUCT ESTIMATE IN ALGEBRAIC DIVISION ALGEBRAS OVER R 1 Mei-Chu Chang Department of Mathematics University of California Riverside, CA 951 mcc@math.ucr.edu Let A be a finite subset of an integral

More information

Distinct Distances in Three and Higher Dimensions

Distinct Distances in Three and Higher Dimensions Distinct Distances in Three and Higher Dimensions Boris Aronov János Pach Micha Sharir Gábor Tardos Abstract Improving an old result of Clarkson et al., we show that the number of distinct distances determined

More information

Almost Cross-Intersecting and Almost Cross-Sperner Pairs offamilies of Sets

Almost Cross-Intersecting and Almost Cross-Sperner Pairs offamilies of Sets Almost Cross-Intersecting and Almost Cross-Sperner Pairs offamilies of Sets Dániel Gerbner a Nathan Lemons b Cory Palmer a Balázs Patkós a, Vajk Szécsi b a Hungarian Academy of Sciences, Alfréd Rényi Institute

More information

The Erdős-Heilbronn Problem for Finite Groups

The Erdős-Heilbronn Problem for Finite Groups The Erdős-Heilbronn Problem for Finite Groups Paul Balister Department of Mathematical Sciences, the University of Memphis Memphis, TN 38152, USA pbalistr@memphis.edu Jeffrey Paul Wheeler Department of

More information

Excluded permutation matrices and the Stanley Wilf conjecture

Excluded permutation matrices and the Stanley Wilf conjecture Excluded permutation matrices and the Stanley Wilf conjecture Adam Marcus Gábor Tardos November 2003 Abstract This paper examines the extremal problem of how many 1-entries an n n 0 1 matrix can have that

More information

Distinct Distances in Three and Higher Dimensions

Distinct Distances in Three and Higher Dimensions Distinct Distances in Three and Higher Dimensions Boris Aronov János Pach Micha Sharir Gábor Tardos ABSTRACT Improving an old result of Clarkson et al., we show that the number of distinct distances determined

More information

Linear independence, a unifying approach to shadow theorems

Linear independence, a unifying approach to shadow theorems Linear independence, a unifying approach to shadow theorems by Peter Frankl, Rényi Institute, Budapest, Hungary Abstract The intersection shadow theorem of Katona is an important tool in extremal set theory.

More information

On the size of minimal unsatisfiable formulas

On the size of minimal unsatisfiable formulas On the size of minimal unsatisfiable formulas Choongbum Lee Submitted: 2008; Accepted: 2008; Published: XX Mathematics Subject Classification: 05D99(Primary); 05C15, 68R10(Secondary) Abstract An unsatisfiable

More information

On distinct distances among points in general position and other related problems

On distinct distances among points in general position and other related problems On distinct distances among points in general position and other related problems Adrian Dumitrescu September 8, 008 Abstract A set of points in the plane is said to be in general position if no three

More information

Erdős-Szekeres without induction

Erdős-Szekeres without induction Erdős-Szekeres without induction arxiv:1509.03332v1 [math.co] 10 Sep 2015 Sergey Norin Yelena Yuditsky October 1, 2018 Abstract Let ES(n) be the minimal integer such that any set of ES(n) points in the

More information

Towards a Katona type proof for the 2-intersecting Erdős-Ko-Rado theorem

Towards a Katona type proof for the 2-intersecting Erdős-Ko-Rado theorem Towards a Katona type proof for the 2-intersecting Erdős-Ko-Rado theorem Ralph Howard Department of Mathematics, University of South Carolina Columbia, SC 29208, USA howard@math.sc.edu Gyula Károlyi Department

More information

Ordered and convex geometric trees with linear extremal function

Ordered and convex geometric trees with linear extremal function Ordered and convex geometric trees with linear extremal function Zoltán Füredi Alexandr Kostochka Dhruv Mubayi Jacques Verstraëte January 22, 2019 Abstract The extremal functions ex (n, F ) and ex (n,

More information

On reducible and primitive subsets of F p, II

On reducible and primitive subsets of F p, II On reducible and primitive subsets of F p, II by Katalin Gyarmati Eötvös Loránd University Department of Algebra and Number Theory and MTA-ELTE Geometric and Algebraic Combinatorics Research Group H-1117

More information

Neighborly families of boxes and bipartite coverings

Neighborly families of boxes and bipartite coverings Neighborly families of boxes and bipartite coverings Noga Alon Dedicated to Professor Paul Erdős on the occasion of his 80 th birthday Abstract A bipartite covering of order k of the complete graph K n

More information

arxiv:math.gr/ v1 12 Nov 2004

arxiv:math.gr/ v1 12 Nov 2004 A talk given at the Institute of Math. Science, Nanjing Univ. on Oct. 8, 2004. GROUPS AND COMBINATORIAL NUMBER THEORY arxiv:math.gr/0411289 v1 12 Nov 2004 Zhi-Wei Sun Department of Mathematics Nanjing

More information

Domination in transitive colorings of tournaments

Domination in transitive colorings of tournaments Domination in transitive colorings of tournaments Dömötör Pálvölgyi Computer Science Department Institute of Mathematics Eötvös Loránd University Pázmány Péter sétány 1/c Budapest, Hungary, H-1117 dom@cs.elte.hu

More information

SZEMERÉDI-TROTTER INCIDENCE THEOREM AND APPLICATIONS

SZEMERÉDI-TROTTER INCIDENCE THEOREM AND APPLICATIONS SZEMERÉDI-TROTTER INCIDENCE THEOREM AND APPLICATIONS PAUL H. KOESTER Given a finite set of points P R 2 and a finite family of lines L, we define the set of incidences of P and L by I(P, L) = {(p, l) P

More information

On the fundamental domain of a discrete group, Proc. Amer. Math. Soc. 41 (1973), Catalan s equation in K(t), Amer. Math.

On the fundamental domain of a discrete group, Proc. Amer. Math. Soc. 41 (1973), Catalan s equation in K(t), Amer. Math. Melvyn B. Nathanson: Books Monographs 1. Additive Number Theory: The Classical Bases, Graduate Texts in Mathematics, Vol. 164, Springer-Verlag, New York, 1996. 2. Additive Number Theory: Inverse Problems

More information

Remarks on a Ramsey theory for trees

Remarks on a Ramsey theory for trees Remarks on a Ramsey theory for trees János Pach EPFL, Lausanne and Rényi Institute, Budapest József Solymosi University of British Columbia, Vancouver Gábor Tardos Simon Fraser University and Rényi Institute,

More information

arxiv: v1 [math.co] 28 Jan 2019

arxiv: v1 [math.co] 28 Jan 2019 THE BROWN-ERDŐS-SÓS CONJECTURE IN FINITE ABELIAN GROUPS arxiv:191.9871v1 [math.co] 28 Jan 219 JÓZSEF SOLYMOSI AND CHING WONG Abstract. The Brown-Erdős-Sós conjecture, one of the central conjectures in

More information

Geometry. The k Most Frequent Distances in the Plane. József Solymosi, 1 Gábor Tardos, 2 and Csaba D. Tóth Introduction

Geometry. The k Most Frequent Distances in the Plane. József Solymosi, 1 Gábor Tardos, 2 and Csaba D. Tóth Introduction Discrete Comput Geom 8:639 648 (00 DOI: 10.1007/s00454-00-896-z Discrete & Computational Geometry 00 Springer-Verlag New York Inc. The k Most Frequent Distances in the Plane József Solymosi, 1 Gábor Tardos,

More information

A note on Gallai-Ramsey number of even wheels

A note on Gallai-Ramsey number of even wheels A note on Gallai-Ramsey number of even wheels Zi-Xia Song a, Bing Wei b, Fangfang Zhang c,a, and Qinghong Zhao b a Department of Mathematics, University of Central Florida, Orlando, FL 32816, USA b Department

More information

Stability of the path-path Ramsey number

Stability of the path-path Ramsey number Worcester Polytechnic Institute Digital WPI Computer Science Faculty Publications Department of Computer Science 9-12-2008 Stability of the path-path Ramsey number András Gyárfás Computer and Automation

More information

Research Problems in Discrete Geometry

Research Problems in Discrete Geometry Research Problems in Discrete Geometry Peter Brass William Moser János Pach Research Problems in Discrete Geometry Peter Brass Department of Computer Science City College, City University of New York 138

More information

Covering the Convex Quadrilaterals of Point Sets

Covering the Convex Quadrilaterals of Point Sets Covering the Convex Quadrilaterals of Point Sets Toshinori Sakai, Jorge Urrutia 2 Research Institute of Educational Development, Tokai University, 2-28-4 Tomigaya, Shibuyaku, Tokyo 5-8677, Japan 2 Instituto

More information

Combinatorics in Hungary and Extremal Set Theory

Combinatorics in Hungary and Extremal Set Theory Combinatorics in Hungary and Extremal Set Theory Gyula O.H. Katona Rényi Institute, Budapest Jiao Tong University Colloquium Talk October 22, 2014 Combinatorics in Hungary A little history. 1 Combinatorics

More information

Interval minors of complete bipartite graphs

Interval minors of complete bipartite graphs Interval minors of complete bipartite graphs Bojan Mohar Department of Mathematics Simon Fraser University Burnaby, BC, Canada mohar@sfu.ca Arash Rafiey Department of Mathematics Simon Fraser University

More information

Szemerédi-Trotter theorem and applications

Szemerédi-Trotter theorem and applications Szemerédi-Trotter theorem and applications M. Rudnev December 6, 2004 The theorem Abstract These notes cover the material of two Applied post-graduate lectures in Bristol, 2004. Szemerédi-Trotter theorem

More information

An Algorithmic Proof of the Lopsided Lovász Local Lemma (simplified and condensed into lecture notes)

An Algorithmic Proof of the Lopsided Lovász Local Lemma (simplified and condensed into lecture notes) An Algorithmic Proof of the Lopsided Lovász Local Lemma (simplified and condensed into lecture notes) Nicholas J. A. Harvey University of British Columbia Vancouver, Canada nickhar@cs.ubc.ca Jan Vondrák

More information

h-fold sums from a set with few products

h-fold sums from a set with few products h-fold sums from a set with few products Dedicated to the memory of György Elekes Ernie Croot Derrick Hart January 7, 2010 1 Introduction Before we state our main theorems, we begin with some notation:

More information

Additive Latin Transversals

Additive Latin Transversals Additive Latin Transversals Noga Alon Abstract We prove that for every odd prime p, every k p and every two subsets A = {a 1,..., a k } and B = {b 1,..., b k } of cardinality k each of Z p, there is a

More information

On Some Three-Color Ramsey Numbers for Paths

On Some Three-Color Ramsey Numbers for Paths On Some Three-Color Ramsey Numbers for Paths Janusz Dybizbański, Tomasz Dzido Institute of Informatics, University of Gdańsk Wita Stwosza 57, 80-952 Gdańsk, Poland {jdybiz,tdz}@inf.ug.edu.pl and Stanis

More information

Many Empty Triangles have a Common Edge

Many Empty Triangles have a Common Edge Discrete Comput Geom 2013 50:244 252 DOI 10.1007/s00454-013-9506-0 Many Empty Triangles have a Common Edge Imre Bárány Jean-François Marckert Matthias Reitzner Received: 18 September 2012 / Revised: 19

More information

arxiv: v1 [math.co] 22 Aug 2015

arxiv: v1 [math.co] 22 Aug 2015 SEPARATION WITH RESTRICTED FAMILIES OF SETS ZSOLT LÁNGI, MÁRTON NASZÓDI, JÁNOS PACH, GÁBOR TARDOS, AND GÉZA TÓTH arxiv:1508.05504v1 [math.co] 22 Aug 2015 Abstract. Given a finite n-element set X, a family

More information

List coloring hypergraphs

List coloring hypergraphs List coloring hypergraphs Penny Haxell Jacques Verstraete Department of Combinatorics and Optimization University of Waterloo Waterloo, Ontario, Canada pehaxell@uwaterloo.ca Department of Mathematics University

More information

BOLYAI SOCIETY MATHEMATICAL STUDIES 25

BOLYAI SOCIETY MATHEMATICAL STUDIES 25 BOLYAI SOCIETY MATHEMATICAL STUDIES 25 BOLYAI SOCIETY MATHEMATICAL STUDIES Editor-in-Chief: Gábor Fejes Tóth Series Editor: Dezs ő Miklós Publication Board: Gyula O. H. Katona László Lovász Péter Pál Pálfy

More information

Game saturation of intersecting families

Game saturation of intersecting families Game saturation of intersecting families Balázs Patkós Máté Vizer November 30, 2012 Abstract We consider the following combinatorial game: two players, Fast and Slow, claim k-element subsets of [n] = {1,

More information

On the maximum number of isosceles right triangles in a finite point set

On the maximum number of isosceles right triangles in a finite point set On the maximum number of isosceles right triangles in a finite point set Bernardo M. Ábrego, Silvia Fernández-Merchant, and David B. Roberts Department of Mathematics California State University, Northridge,

More information

About sunflowers. Óbuda University Bécsi út 96, Budapest, Hungary, H-1037 April 27, 2018

About sunflowers. Óbuda University Bécsi út 96, Budapest, Hungary, H-1037 April 27, 2018 arxiv:1804.10050v1 [math.co] 26 Apr 2018 About sunflowers Gábor Hegedűs Óbuda University Bécsi út 96, Budapest, Hungary, H-1037 hegedus.gabor@nik.uni-obuda.hu April 27, 2018 Abstract Alon, Shpilka and

More information

A non-linear lower bound for planar epsilon-nets

A non-linear lower bound for planar epsilon-nets A non-linear lower bound for planar epsilon-nets Noga Alon Abstract We show that the minimum possible size of an ɛ-net for point objects and line (or rectangle)- ranges in the plane is (slightly) bigger

More information

Towards a Katona type proof for the 2-intersecting Erdős-Ko-Rado theorem

Towards a Katona type proof for the 2-intersecting Erdős-Ko-Rado theorem Towards a Katona type proof for the 2-intersecting Erdős-Ko-Rado theorem Ralph Howard Department of Mathematics, University of South Carolina Columbia, SC 29208, USA howard@math.sc.edu Gyula Károlyi Department

More information

Forbidding complete hypergraphs as traces

Forbidding complete hypergraphs as traces Forbidding complete hypergraphs as traces Dhruv Mubayi Department of Mathematics, Statistics, and Computer Science University of Illinois Chicago, IL 60607 Yi Zhao Department of Mathematics and Statistics

More information

Coloring translates and homothets of a convex body

Coloring translates and homothets of a convex body Coloring translates and homothets of a convex body Adrian Dumitrescu Minghui Jiang August 7, 2010 Abstract We obtain improved upper bounds and new lower bounds on the chromatic number as a linear function

More information

Saturating sets in projective planes and hypergraph covers

Saturating sets in projective planes and hypergraph covers Saturating sets in projective planes and hypergraph covers Zoltán Lóránt Nagy MTA ELTE Geometric and Algebraic Combinatorics Research Group H 7 Budapest, Pázmány P sétány /C, Hungary nagyzoli@cseltehu

More information

On Snevily s Conjecture and Related Topics

On Snevily s Conjecture and Related Topics Jiangsu University (Nov. 24, 2017) and Shandong University (Dec. 1, 2017) and Hunan University (Dec. 10, 2017) On Snevily s Conjecture and Related Topics Zhi-Wei Sun Nanjing University Nanjing 210093,

More information

On set systems with a threshold property

On set systems with a threshold property On set systems with a threshold property Zoltán Füredi 1 Department of Mathematics, University of Illinois at Urbana-Champaign, Urbana, IL 61801, USA, and Rényi Institute of Mathematics of the Hungarian

More information

Norm-graphs: variations and applications

Norm-graphs: variations and applications Norm-graphs: variations and applications Noga Alon 1 School of Mathematics, Institute for Advanced Study Olden Lane, Princeton, NJ 08540 and Department of Mathematics, Tel Aviv University Tel Aviv, Israel

More information

A NOTE ON PARADOXICAL METRIC SPACES (ANNOTATED VERSION, 2004)

A NOTE ON PARADOXICAL METRIC SPACES (ANNOTATED VERSION, 2004) Studia Scientiarum Mathematicarum Hungarica 30 (1995), 17-23 A NOTE ON PARADOXICAL METRIC SPACES (ANNOTATED VERSION, 2004) W. A. DEUBER, M. SIMONOVITS, AND V. T. SÓS 1 1. Introduction Given a metric space,

More information

Point-sets in general position with many similar copies of a pattern

Point-sets in general position with many similar copies of a pattern Point-sets in general position with many similar copies of a pattern Bernardo M. Ábrego and Silvia Fernández-Merchant Department of Mathematics California State University, Northridge, 18111 Nordhoff St,

More information

THE UNIT DISTANCE PROBLEM ON SPHERES

THE UNIT DISTANCE PROBLEM ON SPHERES THE UNIT DISTANCE PROBLEM ON SPHERES KONRAD J. SWANEPOEL AND PAVEL VALTR Abstract. For any D > 1 and for any n 2 we construct a set of n points on a sphere in R 3 of diameter D determining at least cn

More information

ON ZERO-SUM SUBSEQUENCES OF RESTRICTED SIZE. IV

ON ZERO-SUM SUBSEQUENCES OF RESTRICTED SIZE. IV Acta Math. Hungar. 107 (4) (2005), 337 344. ON ZERO-SUM SUBSEQUENCES OF RESTRICTED SIZE. IV R. CHI, S. DING (Dalian), W. GAO (Tianjin), A. GEROLDINGER and W. A. SCHMID (Graz) Abstract. For a finite abelian

More information

POINT SELECTIONS AND WEAK ε-nets FOR CONVEX HULLS

POINT SELECTIONS AND WEAK ε-nets FOR CONVEX HULLS POINT SELECTIONS AND WEAK ε-nets FOR CONVEX HULLS Noga Alon 1 Department of Mathematics, Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel, and Bellcore, Morristown,

More information

Drawing the Horton Set in an Integer Grid of Minimum Size

Drawing the Horton Set in an Integer Grid of Minimum Size CCCG 014, Halifax, Nova Scotia, August 11 13, 014 rawing the Horton Set in an Integer Grid of Minimum Size Luis Barba Frank uque Ruy Fabila-Monroy Carlos Hidalgo-Toscano Abstract In this paper we show

More information

Monochromatic tree covers and Ramsey numbers for set-coloured graphs

Monochromatic tree covers and Ramsey numbers for set-coloured graphs Monochromatic tree covers and Ramsey numbers for set-coloured graphs Sebastián Bustamante and Maya Stein Department of Mathematical Engineering University of Chile August 31, 2017 Abstract We consider

More information

Many Collinear k-tuples with no k + 1 Collinear Points

Many Collinear k-tuples with no k + 1 Collinear Points Discrete Comput Geom (013) 50:811 80 DOI 10.1007/s00454-013-956-9 Many Collinear k-tuples with no k + 1 Collinear Points József Solymosi Miloš Stojaković Received: 5 February 013 / Revised: 1 June 013

More information

arxiv: v1 [math.co] 2 Dec 2013

arxiv: v1 [math.co] 2 Dec 2013 What is Ramsey-equivalent to a clique? Jacob Fox Andrey Grinshpun Anita Liebenau Yury Person Tibor Szabó arxiv:1312.0299v1 [math.co] 2 Dec 2013 November 4, 2018 Abstract A graph G is Ramsey for H if every

More information

SELECTIVELY BALANCING UNIT VECTORS AART BLOKHUIS AND HAO CHEN

SELECTIVELY BALANCING UNIT VECTORS AART BLOKHUIS AND HAO CHEN SELECTIVELY BALANCING UNIT VECTORS AART BLOKHUIS AND HAO CHEN Abstract. A set U of unit vectors is selectively balancing if one can find two disjoint subsets U + and U, not both empty, such that the Euclidean

More information

Monochromatic simplices of any volume

Monochromatic simplices of any volume Monochromatic simplices of any volume Adrian Dumitrescu Department of Computer Science University of Wisconsin Milwaukee WI 53201-0784, USA Email: ad@cs.uwm.edu Minghui Jiang Department of Computer Science

More information

1.1 Szemerédi s Regularity Lemma

1.1 Szemerédi s Regularity Lemma 8 - Szemerédi s Regularity Lemma Jacques Verstraëte jacques@ucsd.edu 1 Introduction Szemerédi s Regularity Lemma [18] tells us that every graph can be partitioned into a constant number of sets of vertices

More information

A DEGREE VERSION OF THE HILTON MILNER THEOREM

A DEGREE VERSION OF THE HILTON MILNER THEOREM A DEGREE VERSION OF THE HILTON MILNER THEOREM PETER FRANKL, JIE HAN, HAO HUANG, AND YI ZHAO Abstract An intersecting family of sets is trivial if all of its members share a common element Hilton and Milner

More information

Probabilistic Proofs of Existence of Rare Events. Noga Alon

Probabilistic Proofs of Existence of Rare Events. Noga Alon Probabilistic Proofs of Existence of Rare Events Noga Alon Department of Mathematics Sackler Faculty of Exact Sciences Tel Aviv University Ramat-Aviv, Tel Aviv 69978 ISRAEL 1. The Local Lemma In a typical

More information

Incidence theorems for pseudoflats

Incidence theorems for pseudoflats Incidence theorems for pseudoflats Izabella Laba and József Solymosi May 25, 2005 Abstract We prove Pach-Sharir type incidence theorems for a class of curves in R n and surfaces in R 3, which we call pseudoflats.

More information

Freiman s theorem in torsion-free groups

Freiman s theorem in torsion-free groups Freiman s theorem in torsion-free groups Mercede MAJ UNIVERSITÀ DEGLI STUDI DI SALERNO ADDITIVE COMBINATORICS IN BORDEAUX Institut de Mathématiques de Bordeaux April, 11-15, 2016 Gregory Freiman, Tel Aviv

More information

On the chromatic number of q-kneser graphs

On the chromatic number of q-kneser graphs On the chromatic number of q-kneser graphs A. Blokhuis & A. E. Brouwer Dept. of Mathematics, Eindhoven University of Technology, P.O. Box 53, 5600 MB Eindhoven, The Netherlands aartb@win.tue.nl, aeb@cwi.nl

More information

Some Elementary Problems (Solved and Unsolved) in Number Theory and Geometry

Some Elementary Problems (Solved and Unsolved) in Number Theory and Geometry Some Elementary Problems (Solved and Unsolved) in Number Theory and Geometry Paul Erdös The Hungarian Academy of Science and Technion, Haifa Dedicated to the memory of Prof. J. Gillis Mathematics is full

More information

arxiv: v1 [math.mg] 10 Feb 2017

arxiv: v1 [math.mg] 10 Feb 2017 Rainbow triangles arxiv:1702.03043v1 [math.mg] 10 Feb 2017 Steven Senger February 9, 2017 Abstract We seek conditions under which colorings of various vector spaces are guaranteed to have a copy of a unit

More information

Bounds on Shannon Capacity and Ramsey Numbers from Product of Graphs

Bounds on Shannon Capacity and Ramsey Numbers from Product of Graphs Bounds on Shannon Capacity and Ramsey Numbers from Product of Graphs Xiaodong Xu Guangxi Academy of Sciences Nanning, Guangxi 530007, China xxdmaths@sina.com and Stanis law P. Radziszowski Department of

More information

and Other Combinatorial Reciprocity Instances

and Other Combinatorial Reciprocity Instances and Other Combinatorial Reciprocity Instances Matthias Beck San Francisco State University math.sfsu.edu/beck [Courtney Gibbons] Act 1: Binomial Coefficients Not everything that can be counted counts,

More information

Choosability and fractional chromatic numbers

Choosability and fractional chromatic numbers Choosability and fractional chromatic numbers Noga Alon Zs. Tuza M. Voigt This copy was printed on October 11, 1995 Abstract A graph G is (a, b)-choosable if for any assignment of a list of a colors to

More information

FINITE FIELDS AND APPLICATIONS Additive Combinatorics in finite fields (3 lectures)

FINITE FIELDS AND APPLICATIONS Additive Combinatorics in finite fields (3 lectures) FINITE FIELDS AND APPLICATIONS Additive Combinatorics in finite fields (3 lectures) Ana Zumalacárregui a.zumalacarregui@unsw.edu.au November 30, 2015 Contents 1 Operations on sets 1 2 Sum-product theorem

More information

Partitioning 2-edge-colored Ore-type graphs by monochromatic cycles

Partitioning 2-edge-colored Ore-type graphs by monochromatic cycles Partitioning 2-edge-colored Ore-type graphs by monochromatic cycles János Barát MTA-ELTE Geometric and Algebraic Combinatorics Research Group barat@cs.elte.hu and Gábor N. Sárközy Alfréd Rényi Institute

More information

SUM-PRODUCT ESTIMATES IN FINITE FIELDS VIA KLOOSTERMAN SUMS

SUM-PRODUCT ESTIMATES IN FINITE FIELDS VIA KLOOSTERMAN SUMS SUM-PRODUCT ESTIMATES IN FINITE FIELDS VIA KLOOSTERMAN SUMS DERRICK HART, ALEX IOSEVICH, AND JOZSEF SOLYMOSI Abstract. We establish improved sum-product bounds in finite fields using incidence theorems

More information

The unit distance problem for centrally symmetric convex polygons

The unit distance problem for centrally symmetric convex polygons The unit distance problem for centrally symmetric convex polygons Bernardo M. Ábrego Department of Mathematics California State University, Northridge Silvia Fernández-Merchant Department of Mathematics

More information

Off-diagonal hypergraph Ramsey numbers

Off-diagonal hypergraph Ramsey numbers Off-diagonal hypergraph Ramsey numbers Dhruv Mubayi Andrew Suk Abstract The Ramsey number r k (s, n) is the minimum such that every red-blue coloring of the k- subsets of {1,..., } contains a red set of

More information

On tight cycles in hypergraphs

On tight cycles in hypergraphs On tight cycles in hypergraphs Hao Huang Jie Ma Abstract A tight k-uniform l-cycle, denoted by T Cl k, is a k-uniform hypergraph whose vertex set is v 0,, v l 1, and the edges are all the k-tuples {v i,

More information

Curriculum vitae : Eötvös Loránd University, Faculty of Science, Budapest,

Curriculum vitae : Eötvös Loránd University, Faculty of Science, Budapest, Curriculum vitae Personals: Name: Péter Ligeti Born: march 14, 1978 E-mail: turul@cs.elte.hu Tel: +36 70 9446585 University: 1996-2001: Eötvös Loránd University, Faculty of Science, Budapest, student of

More information

Equitable Colorings of Corona Multiproducts of Graphs

Equitable Colorings of Corona Multiproducts of Graphs Equitable Colorings of Corona Multiproducts of Graphs arxiv:1210.6568v1 [cs.dm] 24 Oct 2012 Hanna Furmańczyk, Marek Kubale Vahan V. Mkrtchyan Abstract A graph is equitably k-colorable if its vertices can

More information

Report Documentation Page

Report Documentation Page Report Documentation Page Form Approved OMB No. 0704-0188 Public reporting burden for the collection of information is estimated to average 1 hour per response, including the time for reviewing instructions,

More information

Rainbow Hamilton cycles in uniform hypergraphs

Rainbow Hamilton cycles in uniform hypergraphs Rainbow Hamilton cycles in uniform hypergraphs Andrzej Dude Department of Mathematics Western Michigan University Kalamazoo, MI andrzej.dude@wmich.edu Alan Frieze Department of Mathematical Sciences Carnegie

More information

ON THE REDUCIBILITY OF EXACT COVERING SYSTEMS

ON THE REDUCIBILITY OF EXACT COVERING SYSTEMS ON THE REDUCIBILITY OF EXACT COVERING SYSTEMS OFIR SCHNABEL arxiv:1402.3957v2 [math.co] 2 Jun 2015 Abstract. There exist irreducible exact covering systems (ECS). These are ECS which are not a proper split

More information

MONOCHROMATIC VS. MULTICOLORED PATHS. Hanno Lefmann* Department of Mathematics and Computer Science Emory University. Atlanta, Georgia 30332, USA

MONOCHROMATIC VS. MULTICOLORED PATHS. Hanno Lefmann* Department of Mathematics and Computer Science Emory University. Atlanta, Georgia 30332, USA MONOCHROMATIC VS. MULTICOLORED PATHS Hanno Lefmann* Department of Mathematics and Computer Science Emory University Atlanta, Georgia 30322, USA and School of Mathematics Georgia Institute of Technology

More information

Coloring graphs with forbidden induced subgraphs

Coloring graphs with forbidden induced subgraphs Coloring graphs with forbidden induced subgraphs Maria Chudnovsky Abstract. Since graph-coloring is an NP -complete problem in general, it is natural to ask how the complexity changes if the input graph

More information

Old and New Problems and Results in Ramsey Theory

Old and New Problems and Results in Ramsey Theory Old and New Problems and Results in Ramsey Theory Ron Graham University of California, San Diego Abstract In this note, I will describe a variety of problems from Ramsey theory on which I would like to

More information

Jeong-Hyun Kang Department of Mathematics, University of West Georgia, Carrollton, GA

Jeong-Hyun Kang Department of Mathematics, University of West Georgia, Carrollton, GA #A33 INTEGERS 10 (2010), 379-392 DISTANCE GRAPHS FROM P -ADIC NORMS Jeong-Hyun Kang Department of Mathematics, University of West Georgia, Carrollton, GA 30118 jkang@westga.edu Hiren Maharaj Department

More information

Structural results for planar sets with many similar subsets

Structural results for planar sets with many similar subsets Structural results for planar sets with many similar subsets 1 Bernardo M. Ábrego bernardo.abrego@csun.edu 2 György Elekes elekes@cs.elte.hu 1 Silvia Fernández-Merchant silvia.fernandez@csun.edu 1 California

More information

Game saturation of intersecting families

Game saturation of intersecting families Cent. Eur. J. Math. 129) 2014 1382-1389 DOI: 10.2478/s11533-014-0420-3 Central European Journal of Mathematics Game saturation of intersecting families Research Article Balázs Patkós 1, Máté Vizer 1 1

More information

SQUARES AND DIFFERENCE SETS IN FINITE FIELDS

SQUARES AND DIFFERENCE SETS IN FINITE FIELDS SQUARES AND DIFFERENCE SETS IN FINITE FIELDS C. Bachoc 1 Univ Bordeaux, Institut de Mathématiques de Bordeaux, 351, cours de la Libération 33405, Talence cedex, France bachoc@math.u-bordeaux1.fr M. Matolcsi

More information

1 3 0 P Erdős T maxa(z,,,z )= n and for a certain c : max D (z z ) _ (c + o(1))n Now we conjecture that a(z,,,z )D(z,,,z, ) = o (4) n and perhaps it i

1 3 0 P Erdős T maxa(z,,,z )= n and for a certain c : max D (z z ) _ (c + o(1))n Now we conjecture that a(z,,,z )D(z,,,z, ) = o (4) n and perhaps it i Annals of Discrete Mathematics 20 (1984) 1 2 9-136 North-Holland SOME OLD AND NEW PROBLEMS IN COMBINATORIAL GEOMETRY Paul ERDŐS Hungarian Academy o/ Sciences, Budapest, Hungary In this paper several unconnected

More information

Sum-product estimates over arbitrary finite fields

Sum-product estimates over arbitrary finite fields Sum-product estimates over arbitrary finite fields Doowon Koh Sujin Lee Thang Pham Chun-Yen Shen Abstract arxiv:1805.08910v3 [math.nt] 16 Jul 2018 In this paper we prove some results on sum-product estimates

More information