857 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Hungarian Academy of SciencesHU402 papers
- Eötvös Loránd UniversityHU156 papers
- Budapest University of Technology and EconomicsHU58 papers
- Central European UniversityAT42 papers
- École Polytechnique Fédérale de LausanneCH31 papers
- Central European University - Budapest Campus24 papers
- University of PannoniaHU23 papers
- Centre National de la Recherche ScientifiqueFR21 papers
- University College LondonGB20 papers
- University of SzegedHU20 papers
- University of Illinois Urbana-ChampaignUS18 papers
- Charles UniversityCZ15 papers
62 papers · 1 filter
An Erdős-Gallai type theorem for vertex colored graphs
Nika Salia, Casey Tompkins, Oscar Zamora
While investigating odd-cycle free hypergraphs, Győri and Lemons introduced a colored version of the classical theorem of Erdős and Gallai on -free graphs. They proved that an…
Estimating the greatest common divisor of the value of two polynomials
Péter E. Frenkel, Gergely Zábrádi
Let be a fixed prime, and let stand for the exponent of in the prime factorization of the integer . Let and be two monic polynomials with integer coeffici…
Generalized Turán problems for even cycles
Dániel Gerbner, Ervin Győri, Abhishek Methuku +1
Given a graph and a set of graphs , let denote the maximum possible number of copies of in an -free graph on vertices. We i…
On sums of torus knots concordant to alternating knots
Paolo Aceto, Antonio Alfieri
We consider the question, asked by Friedl, Livingston and Zentner, of which sums of torus knots are concordant to alternating knots. After a brief analysis of the problem in its fu…
Analytic properties of spherical cusp forms on GL(n)
Valentin Blomer, Gergely Harcos, Péter Maga
Let be an -normalized spherical vector in an everywhere unramified cuspidal automorphic representation of over with Laplace eigenvalue .…
Tilings of the plane with unit area triangles of bounded diameter
Andrey Kupavskii, János Pach, Gábor Tardos
There exist tilings of the plane with pairwise noncongruent triangles of equal area and bounded perimeter. Analogously, there exist tilings with triangles of equal perimeter, the a…
Efficiently sampling the realizations of irregular, but linearly bounded bipartite and directed degree sequences
Péter L. Erdős, Tamás Róbert Mezei, István Miklós
Since 1997 a considerable effort has been spent on the study of the swap (switch) Markov chains on graphic degree sequences. Several results were proved on rapidly mixing Markov ch…
Average Goldbach and the Quasi-Riemann Hypothesis
Gautami Bhowmik, Imre Z. Ruzsa
We prove that a good average order on the Goldbach generating function implies that the real parts of the non-trivial zeros of the Riemann zeta function are strictly less than 1. T…
On some examples and constructions of contact manifolds
Fabio Gironella
The first goal of this paper is to construct examples of higher dimensional contact manifolds with specific properties. Our main results in this direction are the existence of tigh…
Stability of optimal spherical codes
Károly J. Böröczky, Alexey Glazyrin
For many extremal configurations of points on a sphere, the linear programming approach can be used to show their optimality. In this paper we establish the general framework for s…
Synchronization versus stability of the invariant distribution for a class of globally coupled maps
Péter Bálint, Gerhard Keller, Fanni M. Sélley +1
We study a class of globally coupled maps in the continuum limit, where the individual maps are expanding maps of the circle. The circle maps in question are such that the uncouple…
Some statistical remarks on the Giant GRB Ring
Lajos G. Balázs, Lídia Rejtő, Gábor Tusnády
We studied some statistical properties of the spatial point process displayed by GRBs of known redshift. To find ring like point patterns we developed an algorithm and defined para…
Two extensions of the Erdős-Szekeres problem
Andreas F. Holmsen, Hossein Nassajian Mojarrad, János Pach +1
According to Suk's breakthrough result on the Erdos-Szekeres problem, any point set in general position in the plane, which has no elements that form the vertex set of a convex…
On the Turán number of some ordered even cycles
Ervin Győri, Dániel Korándi, Abhishek Methuku +3
A classical result of Bondy and Simonovits in extremal graph theory states that if a graph on vertices contains no cycle of length then it has at most edges…
The -Minkowski problem for
Gabriele Bianchi, Károly J. Böröczky, Andrea Colesanti +1
Chou and Wang's existence result for the -Minkowski problem on for and an absolutely continuous measure is discussed and extended to more…
Vertex-flames in countable rooted digraphs preserving an Erdős-Menger separation for each vertex
Attila Joó
It follows from a theorem of Lovász that if is a finite digraph with then there is a spanning subdigraph of such that for every vertex t…
Navigating Between Packings of Graphic Sequences
Peter L. Erdos, Michael Ferrara, Stephen G. Hartke
Let and be graphic sequences. We say they \emph{pack} if there exist edge-disjoint realizations and $G_…
Upsilon type concordance invariants
Antonio Alfieri
To a region of the plane satisfying a suitable convexity condition we associate a knot concordance invariant . For appropriate choices of the domain this construction give…
Two-dimensional anisotropic random walks: fixed versus random column configurations for transport phenomena
Endre Csáki, Miklós Csörgő, Antónia Földes +1
We consider random walks on the square lattice of the plane along the lines of Heyde (1982, 1993) and den Hollander (1994), whose studies have in part been inspired by the so-calle…
Exploring the tiers of rooted phylogenetic network space using tail moves
Remie Janssen, Mark Jones, Péter L. Erdős +2
Popular methods for exploring the space of rooted phylogenetic trees use rearrangement moves such as rNNI (rooted Nearest Neighbour Interchange) and rSPR (rooted Subtree Prune and…
Convex sequences may have thin additive bases
Imre Z. Ruzsa, Dmitrii Zhelezov
For a fixed we construct an arbitrarily large set of size such that its sum set contains a convex sequence of size , answering a question of Hegarty.
Multi-Symbol Forbidden Configurations
Keaton Ellis, Baian Liu, Attila Sali
An -matrix is a matrix with symbols in . A matrix is simple if it has no repeated columns. Let the support of a matrix , be the largest si…
Betweenness Structures of Small Linear Co-Size
Péter G. N. Szabó
One way to study the combinatorics of finite metric spaces is to study the betweenness relation associated with the metric space. In the hypergraph metrization problem, one has to…
Turán number of an induced complete bipartite graph plus an odd cycle
Beka Ergemlidze, Ervin Győri, Abhishek Methuku
Let be an integer. We show that if and , or , then the maximum possible number of edges in a -free graph containing no induced copy…