Zobrazeno 1 - 10
of 600
pro vyhledávání: '"Kim, Minki"'
Two celebrated extensions of the classical Helly's theorem are the fractional Helly theorem and the colorful Helly theorem. Bulavka, Goodarzi, and Tancer recently established the optimal bound for the unified generalization of the fractional and the
Externí odkaz:
http://arxiv.org/abs/2408.15093
The Leray number of an abstract simplicial complex is the minimal integer $d$ where its induced subcomplexes have trivial homology groups in dimension $d$ or greater. We give an upper bound on the Leray number of a complex in terms of how the facets
Externí odkaz:
http://arxiv.org/abs/2308.03338
Autor:
Cho, Eun-Kyung, Kim, Minki
In 2011, Henning, L\"{o}wenstein, and Rautenbach observed that the domination number of a graph is bounded from above by the product of the packing number and the maximum degree of the graph. We prove a stronger statement in subcubic graphs: the inde
Externí odkaz:
http://arxiv.org/abs/2307.05119
Autor:
Kim, Minki, Lew, Alan
We present extensions of the Colorful Helly Theorem for $d$-collapsible and $d$-Leray complexes, providing a common generalization to the matroidal versions of the theorem due to Kalai and Meshulam, the ``very colorful" Helly theorem introduced by Ar
Externí odkaz:
http://arxiv.org/abs/2305.12360
A graph class $\mathcal{G}$ has the strong Erd\H{o}s-Hajnal property (SEH-property) if there is a constant $c=c(\mathcal{G}) > 0$ such that for every member $G$ of $\mathcal{G}$, either $G$ or its complement has $K_{m, m}$ as a subgraph where $m \geq
Externí odkaz:
http://arxiv.org/abs/2302.02417
Publikováno v:
Journal of Medical Internet Research, Vol 17, Iss 4, p e90 (2015)
BackgroundThe volume of health-related user-created content, especially hospital-related questions and answers in online health communities, has rapidly increased. Patients and caregivers participate in online community activities to share their expe
Externí odkaz:
https://doaj.org/article/236f0800b49249d59c84e49ab2479ef0
Publikováno v:
Journal of Medical Internet Research, Vol 16, Iss 2, p e29 (2014)
BackgroundHealth 2.0 is a benefit to society by helping patients acquire knowledge about health care by harnessing collective intelligence. However, any misleading information can directly affect patients’ choices of hospitals and drugs, and potent
Externí odkaz:
https://doaj.org/article/54b46d35ee254ca5a69254306d1797d2
Publikováno v:
J. Combin. Theory Ser. B, 158:341-352, January 2023
An independent dominating set of a graph, also known as a maximal independent set, is a set $S$ of pairwise non-adjacent vertices such that every vertex not in $S$ is adjacent to some vertex in $S$. We prove that for $\Delta=4$ or $\Delta\ge 6$, ever
Externí odkaz:
http://arxiv.org/abs/2202.09594