Log in

Relevant bibliographies by topics / Szemerédi / Journal articles

To see the other types of publications on this topic, follow the link: Szemerédi.

Journal articles on the topic 'Szemerédi'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Szemerédi.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

ZHAO, YUFEI. "An arithmetic transference proof of a relative Szemerédi theorem." Mathematical Proceedings of the Cambridge Philosophical Society 156, no. 2 (November 14, 2013): 255–61. http://dx.doi.org/10.1017/s0305004113000662.

Full text

Abstract:

AbstractRecently, Conlon, Fox and the author gave a new proof of a relative Szemerédi theorem, which was the main novel ingredient in the proof of the celebrated Green–Tao theorem that the primes contain arbitrarily long arithmetic progressions. Roughly speaking, a relative Szemerédi theorem says that if S is a set of integers satisfying certain conditions, and A is a subset of S with positive relative density, then A contains long arithmetic progressions, and our recent results show that S only needs to satisfy a so-called linear forms condition.This paper contains an alternative proof of the new relative Szemerédi theorem, where we directly transfer Szemerédi's theorem, instead of going through the hypergraph removal lemma. This approach provides a somewhat more direct route to establishing the result, and it gives better quantitative bounds.The proof has three main ingredients: (1) a transference principle/dense model theorem of Green–Tao and Tao–Ziegler (with simplified proofs given later by Gowers, and independently, Reingold–Trevisan–Tulsiani–Vadhan) applied with a discrepancy/cut-type norm (instead of a Gowers uniformity norm as it was applied in earlier works); (2) a counting lemma established by Conlon, Fox and the author; and (3) Szemerédi's theorem as a black box.

APA, Harvard, Vancouver, ISO, and other styles

2

KOMLÓS, JÁNOS. "The Blow-up Lemma." Combinatorics, Probability and Computing 8, no. 1-2 (January 1999): 161–76. http://dx.doi.org/10.1017/s0963548398003502.

Full text

Abstract:

Extremal graph theory has a great number of conjectures concerning the embedding of large sparse graphs into dense graphs. Szemerédi's Regularity Lemma is a valuable tool in finding embeddings of small graphs. The Blow-up Lemma, proved recently by Komlós, Sárközy and Szemerédi, can be applied to obtain approximate versions of many of the embedding conjectures. In this paper we review recent developments in the area.

APA, Harvard, Vancouver, ISO, and other styles

3

BERGELSON, VITALY, and INGER J. HÅLAND KNUTSON. "Weak mixing implies weak mixing of higher orders along tempered functions." Ergodic Theory and Dynamical Systems 29, no. 5 (February 26, 2009): 1375–416. http://dx.doi.org/10.1017/s0143385708000862.

Full text

Abstract:

AbstractWe extend the weakly mixing PET (polynomial ergodic theorem) obtained in Bergelson [Weakly mixing PET. Ergod. Th. & Dynam. Sys.7 (1987), 337–349] to much wider families of functions. Besides throwing new light on the question of ‘how much higher-degree mixing is hidden in weak mixing’, the obtained results also show the way to possible new extensions of the polynomial Szemerédi theorem obtained in Bergelson and Leibman [Polynomial extensions of van der Waerden’s and Szemerédi’s theorems. J. Amer. Math. Soc.9 (1996), 725–753].

APA, Harvard, Vancouver, ISO, and other styles

4

Raussen, Martin, and Christian Skau. "Interview with Endre Szemerédi." Notices of the American Mathematical Society 60, no. 02 (February 1, 2013): 1. http://dx.doi.org/10.1090/noti948.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Conlon, David, Jacob Fox, and Yufei Zhao. "A relative Szemerédi theorem." Geometric and Functional Analysis 25, no. 3 (March 17, 2015): 733–62. http://dx.doi.org/10.1007/s00039-015-0324-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Kehoe, Elaine. "Szemerédi Receives 2012 Abel Prize." Notices of the American Mathematical Society 59, no. 06 (June 1, 2012): 1. http://dx.doi.org/10.1090/noti855.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Keevash, Peter, and Richard Mycroft. "A multipartite Hajnal–Szemerédi theorem." Journal of Combinatorial Theory, Series B 114 (September 2015): 187–236. http://dx.doi.org/10.1016/j.jctb.2015.04.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Jones, Albin L. "On a result of Szemerédi." Journal of Symbolic Logic 73, no. 3 (September 2008): 953–56. http://dx.doi.org/10.2178/jsl/1230396758.

Full text

Abstract:

AbstractWe provide a short proof that if κ is a regular cardinal with κ < c, thenfor any ordinal α < min{, κ}. In particular,for any ordinal α < . This generalizes an unpublished result of E. Szemerédi that Martin's axiom implies thatfor any cardinal κ with κ < c.

APA, Harvard, Vancouver, ISO, and other styles

9

Adhikari, S. D., L. Boza, S. Eliahou, M. P. Revuelta, and M. I. Sanz. "Numerical semigroups of Szemerédi type." Discrete Applied Mathematics 263 (June 2019): 8–13. http://dx.doi.org/10.1016/j.dam.2018.03.023.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Han, Jie, and Yi Zhao. "On multipartite Hajnal–Szemerédi theorems." Discrete Mathematics 313, no. 10 (May 2013): 1119–29. http://dx.doi.org/10.1016/j.disc.2013.02.008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

BERGELSON, VITALY, and DONALD ROBERTSON. "Polynomial multiple recurrence over rings of integers." Ergodic Theory and Dynamical Systems 36, no. 5 (February 6, 2015): 1354–78. http://dx.doi.org/10.1017/etds.2014.138.

Full text

Abstract:

We generalize the polynomial Szemerédi theorem to intersective polynomials over the ring of integers of an algebraic number field, by which we mean polynomials having a common root modulo every ideal. This leads to the existence of new polynomial configurations in positive-density subsets of $\mathbb{Z}^{m}$ and strengthens and extends recent results of Bergelson, Leibman and Lesigne [Intersective polynomials and the polynomial Szemerédi theorem. Adv. Math.219(1) (2008), 369–388] on polynomials over the integers.

APA, Harvard, Vancouver, ISO, and other styles

12

Kalia, Saarik, Micha Sharir, Noam Solomon, and Ben Yang. "Generalizations of the Szemerédi–Trotter Theorem." Discrete & Computational Geometry 55, no. 3 (February 2, 2016): 571–93. http://dx.doi.org/10.1007/s00454-016-9759-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Bergelson, Vitaly, and Randall McCutcheon. "An ergodic IP polynomial Szemerédi theorem." Memoirs of the American Mathematical Society 146, no. 695 (2000): 0. http://dx.doi.org/10.1090/memo/0695.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Basu, Saugata, and Orit E. Raz. "An o-minimal Szemerédi–Trotter theorem." Quarterly Journal of Mathematics 69, no. 1 (August 22, 2017): 223–39. http://dx.doi.org/10.1093/qmath/hax037.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Shkredov, I. D. "On sums of Szemerédi-Trotter sets." Proceedings of the Steklov Institute of Mathematics 289, no. 1 (May 2015): 300–309. http://dx.doi.org/10.1134/s0081543815040185.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Treglown, Andrew. "A degree sequence Hajnal–Szemerédi theorem." Journal of Combinatorial Theory, Series B 118 (May 2016): 13–43. http://dx.doi.org/10.1016/j.jctb.2016.01.007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Gowers, William. "Hypergraph regularity and the multidimensional Szemerédi theorem." Annals of Mathematics 166, no. 3 (November 1, 2007): 897–946. http://dx.doi.org/10.4007/annals.2007.166.897.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

SANDERS, TOM. "ON A NONABELIAN BALOG–SZEMERÉDI-TYPE LEMMA." Journal of the Australian Mathematical Society 89, no. 1 (June 8, 2010): 127–32. http://dx.doi.org/10.1017/s1446788710000236.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Chen, Yong-Gao, and Jin-Hui Fang. "On a conjecture of Sárközy and Szemerédi." Acta Arithmetica 169, no. 1 (2015): 47–58. http://dx.doi.org/10.4064/aa169-1-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Martin, Ryan, and Endre Szemerédi. "Quadripartite version of the Hajnal–Szemerédi theorem." Discrete Mathematics 308, no. 19 (October 2008): 4337–60. http://dx.doi.org/10.1016/j.disc.2007.08.019.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Bourgain, Jean. "A modular Szemerédi–Trotter theorem for hyperbolas." Comptes Rendus Mathematique 350, no. 17-18 (September 2012): 793–96. http://dx.doi.org/10.1016/j.crma.2012.09.011.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Bergelson, V., A. Leibman, and E. Lesigne. "Intersective polynomials and the polynomial Szemerédi theorem." Advances in Mathematics 219, no. 1 (September 2008): 369–88. http://dx.doi.org/10.1016/j.aim.2008.05.008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Schoen, Tomasz. "New bounds in Balog-Szemerédi-Gowers theorem." Combinatorica 35, no. 6 (October 22, 2014): 695–701. http://dx.doi.org/10.1007/s00493-014-3077-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Bantle, G., and F. Grupp. "On a problem of Erdös and Szemerédi." Journal of Number Theory 22, no. 3 (March 1986): 280–88. http://dx.doi.org/10.1016/0022-314x(86)90012-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Kollár, János. "Szemerédi–Trotter-type theorems in dimension 3." Advances in Mathematics 271 (February 2015): 30–61. http://dx.doi.org/10.1016/j.aim.2014.11.014.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

CZYGRINOW, ANDRZEJ, LOUIS DeBIASIO, H. A. KIERSTEAD, and THEODORE MOLLA. "An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs." Combinatorics, Probability and Computing 24, no. 5 (October 28, 2014): 754–73. http://dx.doi.org/10.1017/s0963548314000716.

Full text

Abstract:

Hajnal and Szemerédi proved that every graph G with |G| = ks and δ(G)⩾ k(s − 1) contains k disjoint s-cliques; moreover this degree bound is optimal. We extend their theorem to directed graphs by showing that every directed graph $\vv G$ with |$\vv G$| = ks and δ($\vv G$) ⩾ 2k(s − 1) − 1 contains k disjoint transitive tournaments on s vertices, where δ($\vv G$)= minv∈V($\vv G$)d−(v)+d+(v). Our result implies the Hajnal–Szemerédi theorem, and its degree bound is optimal. We also make some conjectures regarding even more general results for multigraphs and partitioning into other tournaments. One of these conjectures is supported by an asymptotic result.

APA, Harvard, Vancouver, ISO, and other styles

27

KOUTSOGIANNIS, ANDREAS. "Closest integer polynomial multiple recurrence along shifted primes." Ergodic Theory and Dynamical Systems 38, no. 2 (September 20, 2016): 666–85. http://dx.doi.org/10.1017/etds.2016.40.

Full text

Abstract:

Following an approach presented by Frantzikinakis et al [The polynomial multidimensional Szemerédi theorem along shifted primes. Israel J. Math.194(1) (2013), 331–348], we show that the parameters in the multidimensional Szemerédi theorem for closest integer polynomials have non-empty intersection with the set of shifted primes $\mathbb{P}-1$ (or, similarly, of $\mathbb{P}+1$). Using the Furstenberg correspondence principle, we show this result by recasting it as a polynomial multiple recurrence result in measure ergodic theory. Furthermore, we obtain integer part polynomial convergence results by the same method, which is a transference principle that enables one to deduce results for $\mathbb{Z}$-actions from results for flows. We also give some applications of our approach to Gowers uniform sets.

APA, Harvard, Vancouver, ISO, and other styles

28

TREGLOWN, ANDREW. "On Directed Versions of the Hajnal–Szemerédi Theorem." Combinatorics, Probability and Computing 24, no. 6 (February 5, 2015): 873–928. http://dx.doi.org/10.1017/s0963548315000036.

Full text

Abstract:

We say that a (di)graph G has a perfect H-packing if there exists a set of vertex-disjoint copies of H which cover all the vertices in G. The seminal Hajnal–Szemerédi theorem characterizes the minimum degree that ensures a graph G contains a perfect Kr-packing. In this paper we prove the following analogue for directed graphs: Suppose that T is a tournament on r vertices and G is a digraph of sufficiently large order n where r divides n. If G has minimum in- and outdegree at least (1−1/r)n then G contains a perfect T-packing.In the case when T is a cyclic triangle, this result verifies a recent conjecture of Czygrinow, Kierstead and Molla [4] (for large digraphs). Furthermore, in the case when T is transitive we conjecture that it suffices for every vertex in G to have sufficiently large indegree or outdegree. We prove this conjecture for transitive triangles and asymptotically for all r ⩾ 3. Our approach makes use of a result of Keevash and Mycroft [10] concerning almost perfect matchings in hypergraphs as well as the Directed Graph Removal Lemma [1, 6].

APA, Harvard, Vancouver, ISO, and other styles

29

Peluse, Sarah. "On the polynomial Szemerédi theorem in finite fields." Duke Mathematical Journal 168, no. 5 (April 2019): 749–74. http://dx.doi.org/10.1215/00127094-2018-0051.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Csaba, Béla, and Marcelo Mydlarz. "Approximate multipartite version of the Hajnal–Szemerédi theorem." Journal of Combinatorial Theory, Series B 102, no. 2 (March 2012): 395–410. http://dx.doi.org/10.1016/j.jctb.2011.10.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Tóth, Csaba D. "The Szemerédi-Trotter theorem in the complex plane." Combinatorica 35, no. 1 (February 2015): 95–126. http://dx.doi.org/10.1007/s00493-014-2686-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Frantzikinakis, Nikos, Bernard Host, and Bryna Kra. "The polynomial multidimensional Szemerédi Theorem along shifted primes." Israel Journal of Mathematics 194, no. 1 (October 11, 2012): 331–48. http://dx.doi.org/10.1007/s11856-012-0132-y.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Chang, Mei-Chu. "New results on the Erdös–Szemerédi sum-product problems." Comptes Rendus Mathematique 336, no. 3 (February 2003): 201–5. http://dx.doi.org/10.1016/s1631-073x(03)00018-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Zahl, Joshua. "A Szemerédi–Trotter Type Theorem in $$\mathbb {R}^4$$." Discrete & Computational Geometry 54, no. 3 (August 14, 2015): 513–72. http://dx.doi.org/10.1007/s00454-015-9717-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

BALOGH, JOZSEF, GRAEME KEMKES, CHOONGBUM LEE, and STEPHEN J. YOUNG. "Towards a Weighted Version of the Hajnal–Szemerédi Theorem." Combinatorics, Probability and Computing 22, no. 3 (February 28, 2013): 346–50. http://dx.doi.org/10.1017/s0963548313000059.

Full text

Abstract:

For a positive integer r ≥ 2, a Kr-factor of a graph is a collection vertex-disjoint copies of Kr which covers all the vertices of the given graph. The celebrated theorem of Hajnal and Szemerédi asserts that every graph on n vertices with minimum degree at least $(1-\frac{1}{r})n contains a Kr-factor. In this note, we propose investigating the relation between minimum degree and existence of perfect Kr-packing for edge-weighted graphs. The main question we study is the following. Suppose that a positive integer r ≥ 2 and a real t ∈ [0, 1] is given. What is the minimum weighted degree of Kn that guarantees the existence of a Kr-factor such that every factor has total edge weight at least $$t\binom{r}{2}$?$ We provide some lower and upper bounds and make a conjecture on the asymptotics of the threshold as n goes to infinity.

APA, Harvard, Vancouver, ISO, and other styles

36

Cook, Brian, Ákos Magyar, and Tatchai Titichetrakun. "A Multidimensional Szemerédi Theorem in the Primes via Combinatorics." Annals of Combinatorics 22, no. 4 (November 30, 2018): 711–68. http://dx.doi.org/10.1007/s00026-018-0402-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Host, Bernard, and Bryna Kra. "An odd Furstenberg-Szemerédi theorem and quasi-affine systems." Journal d'Analyse Mathématique 86, no. 1 (December 2002): 183–220. http://dx.doi.org/10.1007/bf02786648.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Borenstein, Evan, and Ernie Croot. "On a Certain Generalization of the Balog–Szemerédi–Gowers Theorem." SIAM Journal on Discrete Mathematics 25, no. 2 (January 2011): 685–94. http://dx.doi.org/10.1137/090778717.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Shabanov, D. A. "A generalization of the Hajnal-Szemerédi theorem for uniform hypergraphs." Doklady Mathematics 90, no. 3 (November 2014): 671–74. http://dx.doi.org/10.1134/s1064562414070059.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Frantzikinakis, Nikos. "A multidimensional Szemerédi theorem for Hardy sequences of different growth." Transactions of the American Mathematical Society 367, no. 8 (December 5, 2014): 5653–92. http://dx.doi.org/10.1090/s0002-9947-2014-06275-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Nenadov, Rajko, and Yanitsa Pehova. "On a Ramsey--Turán Variant of the Hajnal--Szemerédi Theorem." SIAM Journal on Discrete Mathematics 34, no. 2 (January 2020): 1001–10. http://dx.doi.org/10.1137/18m1211970.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Furstenberg, H., and Y. Katznelson. "An ergodic Szemerédi theorem for IP-systems and combinatorial theory." Journal d'Analyse Mathématique 45, no. 1 (December 1985): 117–68. http://dx.doi.org/10.1007/bf02792547.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Green, B. "A Szemerédi-type regularity lemma in abelian groups, with applications." GAFA Geometric And Functional Analysis 15, no. 2 (April 2005): 340–76. http://dx.doi.org/10.1007/s00039-005-0509-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Austin, Tim. "Deducing the multidimensional Szemerédi theorem from an infinitary removal lemma." Journal d'Analyse Mathématique 111, no. 1 (May 2010): 131–50. http://dx.doi.org/10.1007/s11854-010-0014-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

KIERSTEAD, H. A., and A. V. KOSTOCHKA. "A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring." Combinatorics, Probability and Computing 17, no. 2 (March 2008): 265–70. http://dx.doi.org/10.1017/s0963548307008619.

Full text

Abstract:

A proper vertex colouring of a graph is equitable if the sizes of colour classes differ by at most one. We present a new shorter proof of the celebrated Hajnal–Szemerédi theorem: for every positive integer r, every graph with maximum degree at most r has an equitable colouring with r+1 colours. The proof yields a polynomial time algorithm for such colourings.

APA, Harvard, Vancouver, ISO, and other styles

46

Jin, Guoping. "Complete Subgraphs of r-partite Graphs." Combinatorics, Probability and Computing 1, no. 3 (September 1992): 241–50. http://dx.doi.org/10.1017/s0963548300000274.

Full text

Abstract:

The smallest minimal degree of an r-partite graph that guarantees the existence of a complete subgraph of order r has been found for the case r = 3 by Bollobás, Erdő and Szemerédi, who also gave bounds for the cases r ≥ 4. In this paper the exact value is established for the cases r = 4 and 5, and the bounds for r ≥ 6 are improved.

APA, Harvard, Vancouver, ISO, and other styles

47

FOX, JACOB, and BENNY SUDAKOV. "Decompositions into Subgraphs of Small Diameter." Combinatorics, Probability and Computing 19, no. 5-6 (June 9, 2010): 753–74. http://dx.doi.org/10.1017/s0963548310000040.

Full text

Abstract:

We investigate decompositions of a graph into a small number of low-diameter subgraphs. Let P(n, ε, d) be the smallest k such that every graph G = (V, E) on n vertices has an edge partition E = E0 ∪ E1 ∪ ⋅⋅⋅ ∪ Ek such that |E0| ≤ εn2, and for all 1 ≤ i ≤ k the diameter of the subgraph spanned by Ei is at most d. Using Szemerédi's regularity lemma, Polcyn and Ruciński showed that P(n, ε, 4) is bounded above by a constant depending only on ε. This shows that every dense graph can be partitioned into a small number of ‘small worlds’ provided that a few edges can be ignored. Improving on their result, we determine P(n, ε, d) within an absolute constant factor, showing that P(n, ε, 2) = Θ(n) is unbounded for ε < 1/4, P(n, ε, 3) = Θ(1/ε2) for ε > n−1/2 and P(n, ε, 4) = Θ(1/ε) for ε > n−1. We also prove that if G has large minimum degree, all the edges of G can be covered by a small number of low-diameter subgraphs. Finally, we extend some of these results to hypergraphs, improving earlier work of Polcyn, Rödl, Ruciński and Szemerédi.

APA, Harvard, Vancouver, ISO, and other styles

48

Fox, Jacob, and Yufei Zhao. "A short proof of the multidimensional Szemerédi theorem in the primes." American Journal of Mathematics 137, no. 4 (2015): 1139–45. http://dx.doi.org/10.1353/ajm.2015.0028.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Watkins, John J. "Art in the Life of Mathematicians edited by Anna Kepes Szemerédi." Mathematical Intelligencer 39, no. 2 (April 3, 2017): 96–98. http://dx.doi.org/10.1007/s00283-016-9666-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Bourgain, J. "A szemerédi type theorem for sets of positive density inR k." Israel Journal of Mathematics 54, no. 3 (October 1986): 307–16. http://dx.doi.org/10.1007/bf02764959.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!