activity
20192026
collaborators
Showing math.COShow all

7 papers · 1 filter

math.CO2026

Bootstrap percolation of extension hypergraphs

Weichan Liu, Bjarne Schülke, Xin Zhang

For -graphs and the -bootstrap percolation process (or -process) starting with is a sequence of -graphs such that is obtained…

math.CO2025

Hypergraphs accumulate infinitely often

David Conlon, Bjarne Schülke

We show that the set of Turán densities of -uniform hypergraphs has infinitely many accumulation points in for every . This extends an earlier result…

math.CO2025

On possible uniform Turán densities

Dylan King, Simón Piga, Marcelo Sales +1

Given a family of -graphs , the uniform Turán density is defined as the infimum for which any sufficiently large uniformly…

math.CO2025

Infinitely many accumulation points of codegree Turán densities

Heng Li, Weichan Liu, Bjarne Schülke +1

The codegree Turán density of a -graph is the smallest such that every -graph with contains a copy of .…

math.CO2025

Minimum degree in simplicial complexes

Christian Reiher, Bjarne Schülke

Given , let be the largest real number such that every abstract simplicial complex with $0<\vert\mathcal{S}\vert\leqα(d)\vert V(\mathcal{S})\ve…

math.CO2024

Lagrangians are attained as uniform Turán densities

Dylan King, Marcelo Sales, Bjarne Schülke

The study of uniform Turán densities was initiated in the 1980s by Erdős and Sós. Given a -graph , the uniform Turán density of , , is defined as the in…