Zobrazeno 1 - 10
of 93
pro vyhledávání: '"Kim, Younjin"'
A $k$-uniform hypergraph is a hypergraph where each $k$-hyperedge has exactly $k$ vertices. A $k$-homogeneous access structure is represented by a $k$-uniform hypergraph $\mathcal{H}$, in which the participants correspond to the vertices of hypergrap
Externí odkaz:
http://arxiv.org/abs/2309.07479
We prove the following variant of the Erd\H{o}s distinct subset sums problem. Given $t \ge 0$ and sufficiently large $n$, every $n$-element set $A$ whose subset sums are distinct modulo $N=2^n+t$ satisfies $$\max A \ge \Big(\frac{1}{3}-o(1)\Big)N.$$
Externí odkaz:
http://arxiv.org/abs/2308.03748
For a given graph $H$, its subdivisions carry the same topological structure. The existence of $H$-subdivisions within a graph $G$ has deep connections with topological, structural and extremal properties of $G$. One prominent example of such a conne
Externí odkaz:
http://arxiv.org/abs/2207.06653
Publikováno v:
In Journal of Combinatorial Theory, Series B January 2025 170:82-127
Autor:
Kim, Younjin
In 2009, Krivelevich and Sudakov studied the existence of large complete minors in $(t,\alpha)$-expanding graphs whenever the expansion factor $t$ becomes super-constant. In this paper, we give an extension of the results of Krivelevich and Sudakov b
Externí odkaz:
http://arxiv.org/abs/2109.03449
A {\it $k$-uniform hypergraph} $\mathcal{H}=(V, E)$ consists of a set $V$ of vertices and a set $E$ of hyperedges ($k$-hyperedges), which is a family of $k$-subsets of $V$. A {\it forbidden $k$-homogeneous (or forbidden $k$-hypergraph)} access struct
Externí odkaz:
http://arxiv.org/abs/2106.14833
In 1975, Erd\H{o}s asked the following question: what is the smallest function $f(n)$ for which all graphs with $n$ vertices and $f(n)$ edges contain two edge-disjoint cycles $C_1$ and $C_2$, such that the vertex set of $C_2$ is a subset of the verte
Externí odkaz:
http://arxiv.org/abs/2104.04810
Autor:
Kim, Younjin
A subset $A$ of the $k$-dimensional grid $\{1,2, \cdots, N\}^k$ is called $k$-dimensional corner-free if it does not contain a set of points of the form $\{ a \} \cup \{ a + de_i : 1 \leq i \leq k \}$ for some $a \in \{1,2, \cdots, N\}^k$ and $d > 0$
Externí odkaz:
http://arxiv.org/abs/2012.03187
Publikováno v:
In International Journal of Biological Macromolecules 30 September 2023 249
Fix a hypergraph $\mathcal{F}$. A hypergraph $\mathcal{H}$ is called a {\it Berge copy of $\mathcal{F}$} or {\it Berge-$\mathcal{F}$} if we can choose a subset of each hyperedge of $\mathcal{H}$ to obtain a copy of $\mathcal{F}$. A hypergraph $\mathc
Externí odkaz:
http://arxiv.org/abs/1908.00092