Zobrazeno 1 - 10
of 839
pro vyhledávání: '"P. Burghart"'
Let $F$ be a graph on $r$ vertices and let $G$ be a graph on $n$ vertices. Then an $F$-factor in $G$ is a subgraph of $G$ composed of $n/r$ vertex-disjoint copies of $F$, if $r$ divides $n$. In other words, an $F$-factor yields a partition of the $n$
Externí odkaz:
http://arxiv.org/abs/2411.14138
Autor:
Frances M. Baines
Publikováno v:
Animal Welfare, Vol 32 (2023)
Externí odkaz:
https://doaj.org/article/dd3289ff06104304998581fc04102992
Consider the random $u$-uniform hypergraph (or $u$-graph) process on $n$ vertices, where $n$ is divisible by $r>u\ge 2$. It was recently shown that with high probability, as soon as every vertex is covered by a copy of the complete $u$-graph $K_r$, i
Externí odkaz:
http://arxiv.org/abs/2409.17764
Autor:
Daniela Bevilacqua
Publikováno v:
European Bulletin of Himalayan Research, Vol 54, Pp 108-111 (2020)
Externí odkaz:
https://doaj.org/article/a652c4da3c7b4f92b3de2e768378e0ff
Autor:
Burghart, Fabian, Wagner, Stephan
A $B$-tree is a type of search tree where every node (except possibly for the root) contains between $m$ and $2m$ keys for some positive integer $m$, and all leaves have the same distance to the root. We study sequences of $B$-trees that can arise fr
Externí odkaz:
http://arxiv.org/abs/2406.06359
Autor:
Dot Porter
Publikováno v:
Digital Medievalist, Vol 7, Iss 0 (2011)
This site, published by the Digital Humanities programme of the UMR 5648 - Histoire, Archéologie, Littératures des Mondes Chrétiens et Musulmans Médiévaux in France, offers a practical introduction to the art and science of reading manuscript te
Externí odkaz:
https://doaj.org/article/40e784374dc74908a6ba59f99ceaebe4
Autor:
Burghart, Fabian, Thévenin, Paul
We consider the concatenation of $t$ uniformly random perfect matchings on $2n$ vertices, where the operation of concatenation is inspired by the multiplication of generators of the Brauer algebra $\mathfrak{B}_n(\delta)$. For the resulting random st
Externí odkaz:
http://arxiv.org/abs/2306.11596
Autor:
Burghart, Fabian
We consider three bivariate polynomial invariants $P$, $A$, and $S$ for rooted trees, as well as a trivariate polynomial invariant $M$. These invariants are motivated by random destruction processes such as the random cutting model or site percolatio
Externí odkaz:
http://arxiv.org/abs/2302.08394
Autor:
Burghart, Fabian
We define the notions of disjoint unions and products for generalised P\'olya urns, proving that this turns the set of isomorphism classes of urns into a commutative semiring. The set of square matrices up to similarity by a permutation matrix is als
Externí odkaz:
http://arxiv.org/abs/2111.07810
Autor:
Burghart, Fabian
We propose a modification to the random destruction of graphs: Given a finite network with a distinguished set of sources and targets, remove (cut) vertices at random, discarding components that do not contain a source node. We investigate the number
Externí odkaz:
http://arxiv.org/abs/2111.02968