BS
Bjarne Schülke
math.CO
On Valency
published · living versionsW_7crybnmf·v1 · currentpublished
Characterizing -graphs with Degenerate Codegree Turán Density
with Dylan King, Simón Piga, Marcelo Sales
1 version
Preprints & journals
25 papers in the corpus · 2019–2026Upper bounds on the running time of bootstrap percolation2604.22630v2 · Weichan Liu, Xiangxiang Nie, Sim'on Piga et al.2026 · 0 citationsarXiv
Bootstrap percolation of extension hypergraphs2604.04607v1 · Weichan Liu, Bjarne Schulke, Xin Zhang2026 · 0 citationsarXiv
Hypergraphs accumulate infinitely often2506.03080v1 · David Conlon, Bjarne Schulke2025 · 0 citationsarXiv
On possible uniform Turán densities2504.21220v2 · Dylan King, Sim'on Piga, Marcelo Sales et al.2025 · 0 citationsarXiv
Infinitely many accumulation points of codegree Turán densities2502.13485v3 · Heng Li, Weichan Liu, Bjarne Schulke et al.2025 · 0 citationsarXiv
Minimum degree in simplicial complexes2501.01294v1 · Christian Reiher, Bjarne Schulke2025 · 0 citationsarXiv
Lagrangians are attained as uniform Turán densities2412.07297v1 · Dylan King, Marcelo Sales, Bjarne Schulke2024 · 0 citationsarXiv
Separating hypergraph Turán densities2410.08921v2 · Hong Liu, Bjarne Schulke, Shuaichao Wang et al.2024 · 0 citationsarXiv
Hypergraphs accumulate2405.08239v1 · David Conlon, Bjarne Schulke2024 · 3 citationsarXiv
Simplicial Turán problems2310.01822v1 · David Conlon, Sim'on Piga, Bjarne Schulke2023 · 0 citationsarXiv
Hypergraphs with arbitrarily small codegree Turán density2307.02876v1 · Sim'on Piga, Bjarne Schulke2023 · 3 citationsarXiv
The codegree Turán density of tight cycles minus one edge2211.12721v1 · Sim'on Piga, Marcelo Sales, Bjarne Schulke2022 · 8 citationsarXiv
Beyond the broken tetrahedron2211.12747v2 · August Y. Chen, Bjarne Schulke2022 · 1 citationarXiv
A local version of Katona's intersection theorem2206.04278v1 · Marcelo Sales, Bjarne Schulke2022 · 0 citationsarXiv
Decomposing hypergraphs into cycle factors2104.06333v1 · Felix Joos, Marcus Kuhn, Bjarne Schulke2021 · 0 citationsarXiv
-cross -intersecting families via necessary intersection points2010.11928v2 · Pranshu Gupta, Yannick Mogge, Sim'on Piga et al.2020 · 0 citationsarXiv
On extremal problems concerning the traces of sets2007.04261v1 · Sim'on Piga, Bjarne Schulke2020 · 1 citationarXiv
On Hamiltonian cycles in hypergraphs with dense link graphs2007.03820v1 · Joanna Polcyn, Christian Reiher, Vojtech Rodl et al.2020 · 10 citationsJournal of Combinatorial Theory, Series B 150 (2021), 17-75
Covering -edge-coloured random graphs with monochromatic trees2006.14469v1 · Yoshiharu Kohayakawa, Walner Mendonca, Guilherme Oliveira Mota et al.2020 · 0 citationsarXiv
Minimum pair degree condition for tight Hamiltonian cycles in -uniform hypergraphs2005.03391v1 · Joanna Polcyn, Christian Reiher, Vojtech Rodl et al.2020 · 7 citationsActa Mathematica Hungarica 161 (2020), no. 2, 647--699
Short proof that Kneser graphs are Hamiltonian for 1912.08186v1 · Johann Bellmann, Bjarne Schulke2019 · 0 citationsarXiv
Clique factors in Kneser graphs1911.10190v2 · Johann Bellmann, Bjarne Schulke2019 · 0 citationsarXiv
Convex graphon parameters and graph norms1910.08454v2 · Joonkyung Lee, Bjarne Schulke2019 · 7 citationsarXiv
A pair degree condition for Hamiltonian cycles in -uniform hypergraphs1910.02691v2 · Bjarne Schulke2019 · 7 citationsarXiv
Embedding spanning subgraphs in uniformly dense and inseparable graphs1909.13071v1 · Oliver Ebsen, Giulia S. Maesaka, Christian Reiher et al.2019 · 8 citationsarXiv
Career total: 35 works. 25 are in this corpus.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.