Related papers: On a certain generalization of the Balog-Szemeredi…
In this note, we obtain a quantitative improvement on the hypergraph variant of the Balog-Szemer\'{e}di-Gowers theorem due to Sudakov, Szemer\'{e}di, and Vu [Duke Math. J.129.1 (2005): 129--155]. Additionally, we prove the hypergraph…
We give a combinatorial proof, using the hyperbolicity of the curve graphs, of the bounded geodesic image theorem of Masur and Minsky. Recently it has been shown that curve graphs are uniformly hyperbolic, thus a universal bound can be…
In this paper, we present a variant of the Balog-Szemer\'edi-Gowers theorem for the Vinogradov system. We then use our result to deduce a higher degree analogue of the sum-product phenomenon.
We obtain a hypergraph generalisation of the graph blow-up lemma proved by Komlos, Sarkozy and Szemeredi, showing that hypergraphs with sufficient regularity and no atypical vertices behave as if they were complete for the purpose of…
We present a short proof of Szemer\'edi's Theorem using a dynamical system enriched by ideas from model theory. The resulting proof contains features reminiscent of proofs based on both ergodic theory and on hypergraph regularity.
In this note, we present a simple non-directed graph proof of Sharkovsky's theorem which is different from the one given in [2].
We prove analogues for hypergraphs of Szemer\'edi's regularity lemma and the associated counting lemma for graphs. As an application, we give the first combinatorial proof of the multidimensional Szemer\'edi theorem of Furstenberg and…
The famous Conway--Gordon--Sachs theorem for the complete graph on six vertices was extended to the general complete graph on $n$ vertices by Kazakov--Korablev as a congruence modulo $2$, and its integral lift was given by…
In this paper we give a generalization of a result of Wei.
Combining Ky Fan's theorem with ideas of Greene and Matousek we prove a generalization of Dol'nikov's theorem. Using another variant of the Borsuk-Ulam theorem due to Bacon and Tucker, we also prove the presence of all possible completely…
We give a cohomological characterization of Gromov relative hyperbolicity. As an application we prove a converse to the combination theorem for graphs of relatively hyperbolic groups given in a previous paper of the first author. We build…
In this note, we present a simple directed graph proof of Sharkovsky's theorem.
We show that a sufficiently large graph of bounded degree can be decomposed into quasi-homogeneous pieces. The result can be viewed as a "finitarization" of the classical Farrell-Varadarajan Ergodic Decomposition Theorem.
In this article we present a generalization of a Leibniz's geometrical theorem and an application of it.
This is a companion note to our paper 'Some advances on Sidorenko's conjecture', elaborating on a remark in that paper that the approach which proves Sidorenko's conjecture for strongly tree-decomposable graphs may be extended to a broader…
Hypergraphs, as a generalization of simplicial complexes, have long been a subject of interest in their geometric interpretation. The subdivision of simplicial complexes can, to some extent, provide insights into the geometry of simplicial…
We prove a generalization of Lopes's theorem, that is, of the converse of Brolin's theorem.
A new generalization of the classical separate algebraicity theorem is suggested and proved.
In this paper we prove a generalized version of Hall's theorem for hypergraphs. More precisely, let H be a k-uniform k- partite hypergraph with some ordering on parts as V1, V2,..., Vk. such that the subhypergraph generated on union of V1,…
We generalize the Harary-Sachs theorem to $k$-uniform hypergraphs: the codegree-$d$ coefficient of the characteristic polynomial of a uniform hypergraph ${\cal H}$ can be expressed as a weighted sum of subgraph counts over certain…