Barnabás Janzer

activity

20172025

most citedGeneralizations of the Ruzsa-Szemerédi and rainbow Turán problems for cliques

18 citations · 39 across the 17 of their papers we have counts for

collaborators

Showing 2024Show all

5 papers · 1 filter

math.CO2024

Tight bounds for intersection-reverse sequences, edge-ordered graphs and applications

Barnabás Janzer, Oliver Janzer, Abhishek Methuku +1

In 2006, Marcus and Tardos proved that if $A^{1}, \dots, A^{n}$ are cyclic orders on some subsets of a set of $n$ symbols such that the common elements of any two distinct orders $A^{i}$ a…

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.CO2024

Tight general bounds for the extremal numbers of 0-1 matrices

Barnabás Janzer, Oliver Janzer, Van Magnan +1

A zero-one matrix $M$ is said to contain another zero-one matrix $A$ if we can delete some rows and columns of $M$ and replace some $1$ -entries with $0$ -entries such that the resul…

math.CO2024

Packing the largest trees in the tree packing conjecture

Barnabás Janzer, Richard Montgomery

The famous tree packing conjecture of Gyárfás from 1976 says that any sequence of trees $T_{1}, \dots, T_{n}$ such that $∣ T_{i} ∣ = i$ for each $i \in [n]$ packs into the complete $n$ -vertex…

math.CO2024

Ordered Ramsey numbers of powers of paths

António Girão, Barnabás Janzer, Oliver Janzer

Given two vertex-ordered graphs $G$ and $H$ , the ordered Ramsey number $R_{<} (G, H)$ is the smallest $N$ such that whenever the edges of a vertex-ordered complete graph $K_{N}$ are red/…