Barnabás Janzer

activity

20242026

collaborators

Showing math.COShow all

6 papers · 1 filter

math.CO2026

Sunflowers and Ramsey problems for restricted intersections

BarnabÃ¡s Janzer, Zhihan Jin, Benny Sudakov +1

Extremal problems on set systems with restricted intersections have been an important part of combinatorics in the last 70 years. In this paper, we study the following Ramsey versi…

math.CO2026

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$ -verte…

math.CO2025

Extending Thomassen's conjecture to directed graphs

Micha Christoph, BarnabÃ¡s Janzer, Kalina Petrova +1

A famous conjecture by Thomassen from 1983 asserts that for any given $k, g \in N$ there exists some $d = d (k, g) \in N$ such that every graph of minimum degree at leas…

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 leas…

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…