Zobrazeno 1 - 10
of 32
pro vyhledávání: '"Guillermo Pineda Villavicencio"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings, 28th... (2020)
this is an extended abstract of the full version. We study n-vertex d-dimensional polytopes with at most one nonsimplex facet with, say, d + s vertices, called almost simplicial polytopes. We provide tight lower and upper bounds for the face numbers
Externí odkaz:
https://doaj.org/article/709cd6da43534789b606b52c2dd09dbd
Publikováno v:
SIAM Journal on Discrete Mathematics. 36:2920-2941
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4843a29f8666b4fb1b71b7494115f3c1
https://doi.org/10.1137/21m144832x
https://doi.org/10.1137/21m144832x
Publikováno v:
The Electronic Journal of Combinatorics. 29
We define two $d$-polytopes, both with $2d+2$ vertices and $(d+3)(d-1)$ edges, which reduce to the cube and the 5-wedge in dimension three. We show that they are the only minimisers of the number of edges, amongst all $d$-polytopes with $2d+2$ vertic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a2e41d1ce0397246c592b2e74728f709
https://doi.org/10.37236/10374
https://doi.org/10.37236/10374
Publikováno v:
Scopus-Elsevier
We study $n$-vertex $d$-dimensional polytopes with at most one nonsimplex facet with, say, $d+s$ vertices, called almost simplicial polytopes. We provide tight lower and upper bound theorems for these polytopes as functions of $d,n$, and $s$, thus ge
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c2b7da61aacb9f6379cc7211be67bd62
https://doi.org/10.4153/s0008414x18000123
https://doi.org/10.4153/s0008414x18000123
This paper is concerned with the linkedness of Cartesian products of complete graphs. A graph with at least $2k$ vertices is {\it $k$-linked} if, for every set of $2k$ distinct vertices organised in arbitrary $k$ pairs of vertices, there are $k$ vert
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ff0e4c9fbb8641eee0681dd2748d2e71
http://arxiv.org/abs/2012.05576
http://arxiv.org/abs/2012.05576
We specify what is meant for a polytope to be reconstructible from its graph or dual graph. And we introduce the problem of class reconstructibility, i.e., the face lattice of the polytope can be determined from the (dual) graph within a given class.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6cfe23993b84b8bd43f8721a2b76cb9e
http://arxiv.org/abs/2010.10227
http://arxiv.org/abs/2010.10227
Publikováno v:
Health informatics journal. 26(3)
This study will highlight the diagnostic potential that radar plots display for reporting on performance benchmarking from patient admissions to hospital for surgical procedures. Two drawbacks of radar plots – the presence of missing information an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6036426b0d833f2a6e448c6d561329d4
https://pubmed.ncbi.nlm.nih.gov/31957560
https://pubmed.ncbi.nlm.nih.gov/31957560
The paper is concerned with the linkedness of the graphs of cubical polytopes. A graph with at least $2k$ vertices is \textit{$k$-linked} if, for every set of $k$ disjoint pairs of vertices, there are $k$ vertex-disjoint paths joining the vertices in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::af16e2c4d5d3de64bf3b5c7cc03e9a85
Publikováno v:
Discrete & Computational Geometry. 64:200-215
It is known that polytopes with at most two nonsimple vertices are reconstructible from their graphs, and that $d$-polytopes with at most $d-2$ nonsimple vertices are reconstructible from their 2-skeletons. Here we close the gap between 2 and $d-2$,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ba50ea51d072cdcb7d1e1effa558df1e
https://doi.org/10.1007/s00454-018-00053-y
https://doi.org/10.1007/s00454-018-00053-y
Publikováno v:
SIAM Journal on Discrete Mathematics. 32:2011-2046
We define the excess degree $\xi(P)$ of a $d$-polytope $P$ as $2f_1-df_0$, where $f_0$ and $f_1$ denote the number of vertices and edges, respectively. This parameter measures how much $P$ deviates from being simple. It turns out that the excess degr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e028360ec99d453f544102ad552615d7
https://doi.org/10.1137/17m1131994
https://doi.org/10.1137/17m1131994