Stefan Glock

activity

20142026

most citedOptimal path and cycle decompositions of dense quasirandom graphs

25 citations · 107 across the 24 of their papers we have counts for

collaborators

Showing 2022 · math.COShow all

2 papers · 2 filters

math.CO2022

On the $(6, 4)$ -problem of Brown, Erdős and Sós

Stefan Glock, Felix Joos, Jaehoon Kim +3

Let $f^{(r)} (n; s, k)$ be the maximum number of edges of an $r$ -uniform hypergraph on $n$ vertices not containing a subgraph with $k$ edges and at most $s$ vertices. In 1973, Brown,…

math.CO2022

Conflict-free hypergraph matchings

Stefan Glock, Felix Joos, Jaehoon Kim +2

A celebrated theorem of Pippenger, and Frankl and Rödl states that every almost-regular, uniform hypergraph $H$ with small maximum codegree has an almost-perfect matching…

On the (6,4)-problem of Brown, Erdős and Sós

Conflict-free hypergraph matchings

On the $(6, 4)$ -problem of Brown, Erdős and Sós