Zobrazeno 1 - 10
of 3 182
pro vyhledávání: '"A, Schülke"'
Erd\H{o}s asked whether, similarly as for graphs, the Tur\'an density of $K_4^{(3)}$ is the same as that of $K_5^{(3)-}$. This was disproved by Markstr\"om using a proof that relied on computer-aided flag algebra calculations. Here we give a flag-alg
Externí odkaz:
http://arxiv.org/abs/2410.08921
Autor:
Conlon, David, Schülke, Bjarne
We show that for every integer $k\geq3$, the set of Tur\'an densities of $k$-uniform hypergraphs has an accumulation point in $[0,1)$. In particular, $1/2$ is an accumulation point for the set of Tur\'an densities of $3$-uniform hypergraphs.
Com
Com
Externí odkaz:
http://arxiv.org/abs/2405.08239
Autor:
Gastinger, Julia, Meilicke, Christian, Errica, Federico, Sztyler, Timo, Schuelke, Anett, Stuckenschmidt, Heiner
Temporal Knowledge Graph (TKG) Forecasting aims at predicting links in Knowledge Graphs for future timesteps based on a history of Knowledge Graphs. To this day, standardized evaluation protocols and rigorous comparison across TKG models are availabl
Externí odkaz:
http://arxiv.org/abs/2404.16726
Autor:
Vogg, Richard, Lüddecke, Timo, Henrich, Jonathan, Dey, Sharmita, Nuske, Matthias, Hassler, Valentin, Murphy, Derek, Fischer, Julia, Ostner, Julia, Schülke, Oliver, Kappeler, Peter M., Fichtel, Claudia, Gail, Alexander, Treue, Stefan, Scherberger, Hansjörg, Wörgötter, Florentin, Ecker, Alexander S.
Advances in computer vision as well as increasingly widespread video-based behavioral monitoring have great potential for transforming how we study animal cognition and behavior. However, there is still a fairly large gap between the exciting prospec
Externí odkaz:
http://arxiv.org/abs/2401.16424
A simplicial complex $H$ consists of a pair of sets $(V,E)$ where $V$ is a set of vertices and $E\subseteq\mathscr{P}(V)$ is a collection of subsets of $V$ closed under taking subsets. Given a simplicial complex $F$ and $n\in \mathbb N$, the extremal
Externí odkaz:
http://arxiv.org/abs/2310.01822
Autor:
Piga, Simón, Schülke, Bjarne
Let $k\geq 3$. Given a $k$-uniform hypergraph $H$, the minimum codegree $\delta(H)$ is the largest $d\in\mathbb{N}$ such that every $(k-1)$-set of $V(H)$ is contained in at least $d$ edges. Given a $k$-uniform hypergraph $F$, the codegree Tur\'an den
Externí odkaz:
http://arxiv.org/abs/2307.02876
Autor:
Chen, August, Schülke, Bjarne
Here we consider the hypergraph Tur\'an problem in uniformly dense hypergraphs as was suggested by Erd\H{o}s and S\'os. Given a $3$-graph $F$, the uniform Tur\'an density $\pi_u(F)$ of $F$ is defined as the supremum over all $d\in[0,1]$ for which the
Externí odkaz:
http://arxiv.org/abs/2211.12747
Given $\alpha>0$ and an integer $\ell\geq5$, we prove that every sufficiently large $3$-uniform hypergraph $H$ on $n$ vertices in which every two vertices are contained in at least $\alpha n$ edges contains a copy of $C_\ell^{-}$, a tight cycle on $\
Externí odkaz:
http://arxiv.org/abs/2211.12721
Autor:
Sales, Marcelo, Schülke, Bjarne
Katona's intersection theorem states that every intersecting family $\mathcal F\subseteq[n]^{(k)}$ satisfies $\vert\partial\mathcal F\vert\geq\vert\mathcal F\vert$, where $\partial\mathcal F=\{F\setminus x:x\in F\in\mathcal F\}$ is the shadow of $\ma
Externí odkaz:
http://arxiv.org/abs/2206.04278
Autor:
Sterck, Elisabeth H.M., Crockford, Catherine, Fischer, Julia, Massen, Jorg J.M., Tiddi, Barbara, Perry, Susan, Sueur, Cédric, Schülke, Oliver, Ostner, Julia
Publikováno v:
In Evolution and Human Behavior November 2024 45(6)
