HUN-REN Alfréd Rényi Institute of Mathematics

output

19942026

most citedBrownian distance covariance

857 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions

Showing 2023 · math.COShow all

11 papers · 2 filters

math.CO2023★ 1 cited

$H$ -percolation with a random $H$

Zsolt Bartha, Brett Kolesnik, Gal Kronenberg

In $H$ -percolation, we start with an Erdős--Rényi graph $G_{n, p}$ and then iteratively add edges that complete copies of $H$ . The process percolates if all edges missing…

math.CO2023

Maximal line-free sets in $F_{p}^{n}$

Christian Elsholtz, Jakob Führer, Erik Füredi +4

We study subsets of $F_{p}^{n}$ that do not contain progressions of length $k$ . We denote by $r_{k} (F_{p}^{n})$ the cardinality of such subsets containing a maximal number…

math.CO2023★ 1 cited

Distinguishing colorings, proper colorings, and covering properties without the Axiom of Choice

Amitayu Banerjee, Zalán Molnár, Alexa Gopaulsingh

We work with simple graphs in ZF (Zermelo--Fraenkel set theory without the Axiom of Choice (AC)) and assume that the sets of colors can be either well-orderable or non-well-orderab…

math.CO2023★ 2 cited

Monochromatic infinite sets in Minkowski planes

Nóra Frankl, Panna Gehér, Arsenii Sagdeev +1

We prove that for any $ℓ_{p}$ -norm in the plane with $1 < p < \infty$ and for every infinite $M \subset R^{2}$ , there exists a two-colouring of the plane such that no…

math.CO2023

On the number of tangencies among $1$ -intersecting $x$ -monotone curves

Eyal Ackerman, Balázs Keszegh

Let $\cC$ be a set of curves in the plane such that no three curves in $\cC$ intersect at a single point and every pair of curves in $\cC$ intersect at exactly one point which is e…

math.CO2023★ 3 cited

Partial reflections and globally linked pairs in rigid graphs

Dániel Garamvölgyi, Tibor Jordán

A $d$ -dimensional framework is a pair $(G, p)$ , where $G$ is a graph and $p$ maps the vertices of $G$ to points in $R^{d}$ . The edges of $G$ are mapped to the corresponding l…

math.CO2023

Stability from graph symmetrization arguments in generalized Turán problems

Dániel Gerbner, Hilal Hama Karim

Given graphs $H$ and $F$ , $ex (n, H, F)$ denotes the largest number of copies of $H$ in $F$ -free $n$ -vertex graphs. Let $χ (H) < χ (F) = r + 1$ . We say that $H$ is $F$ -Turán-stable i…

math.CO2023

On asymptotic local Turán problems

Peter Frankl, Jiaxi Nie

An $r$ -uniform hypergraph has $(q, p)$ -property if any set of $q$ vertices spans a complete sub-hypergraph on $p$ vertices. Let $t_{r} (n, q, p)$ be the minimum edge density of an $n$ -ve…

math.CO2023★ 1 cited

Posets are easily testable

Panna Tímea Fekete, Gábor Kun

Alon and Shapira proved that every monotone class (closed under taking subgraphs) of undirected graphs is strongly testable, that is, under the promise that a given graph is either…

math.CO2023

Monochromatic triangles in the max-norm plane

Alexander Natalchenko, Arsenii Sagdeev

For all non-degenerate triangles T, we determine the minimum number of colors needed to color the plane such that no max-norm isometric copy of T is monochromatic.

math.CO2023

Modified Erdős-Ginzburg-Ziv constants for $Z_{2}^{d}$

Alexander Sidorenko

Let $G$ be a finite abelian group written additively, and let $r$ be a multiple of its exponent. The modified Erdős-Ginzburg-Ziv constant $s_{r}^{'} (G)$ is the smallest integer…

H-percolation with a random H

Maximal line-free sets in Fpn​

Distinguishing colorings, proper colorings, and covering properties without the Axiom of Choice

Monochromatic infinite sets in Minkowski planes

On the number of tangencies among 1-intersecting x-monotone curves

Partial reflections and globally linked pairs in rigid graphs

Stability from graph symmetrization arguments in generalized Turán problems

On asymptotic local Turán problems

Posets are easily testable

Monochromatic triangles in the max-norm plane

Modified Erdős-Ginzburg-Ziv constants for Z2d​

$H$ -percolation with a random $H$

Maximal line-free sets in $F_{p}^{n}$

On the number of tangencies among $1$ -intersecting $x$ -monotone curves

Modified Erdős-Ginzburg-Ziv constants for $Z_{2}^{d}$