Barnabás Janzer

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2024

Chromatic number and regular subgraphs

Barnabás Janzer, Raphael Steiner, Benny Sudakov

In 1992, Erdős and Hajnal posed the following natural problem: Does there exist, for every $r \in N$ , an integer $F (r)$ such that every graph with chromatic number at least…

math.CO2022

Partial shuffles by lazy swaps

Barnabás Janzer, J. Robert Johnson, Imre Leader

What is the smallest number of random transpositions (meaning that we swap given pairs of elements with given probabilities) that we can make on an $n$ -point set to ensure that eac…

math.CO2022★ 1 cited

Long running times for hypergraph bootstrap percolation

Alberto Espuny Díaz, Barnabás Janzer, Gal Kronenberg +1

Consider the hypergraph bootstrap percolation process in which, given a fixed $r$ -uniform hypergraph $H$ and starting with a given hypergraph $G_{0}$ , at each step we add to $G_{0}$ al…

math.CO2019

Projections of antichains

Barnabás Janzer

A subset $A$ of $Z^{n}$ is called a weak antichain if it does not contain two elements $x$ and $y$ satisfying $x_{i} < y_{i}$ for all $i$ . Engel, Mitsis, Pelekis and Reiher showed…

math.CO2019

A note on antichains in the continuous cube

Barnabás Janzer

It is well-known that an antichain in the poset $[0, 1]^{n}$ must have measure zero. Engel, Mitsis, Pelekis and Reiher showed that in fact it must have $(n - 1)$ -dimensional Hausdorff m…