Zobrazeno 1 - 10
of 182
pro vyhledávání: '"Tokushige, Norihide"'
Autor:
Tokushige, Norihide
The Hamming graph $H(n,q)$ is defined on the vertex set $\{1,2,\ldots,q\}^n$ and two vertices are adjacent if and only if they differ in precisely one coordinate. Alon proved that for any sequence $v_1,\ldots,v_b$ of $b=\lceil\frac n2\rceil$ vertices
Externí odkaz:
http://arxiv.org/abs/2406.19945
Autor:
Tokushige, Norihide
The Hamming graph $H(n,q)$ is defined on the vertex set $[q]^n$ and two vertices are adjacent if and only if they differ in precisely one coordinate. Alon \cite{Alon} proved that the burning number of $H(n,2)$ is $\lceil\frac n2\rceil+1$. In this not
Externí odkaz:
http://arxiv.org/abs/2405.01347
Autor:
Tanaka, Hajime, Tokushige, Norihide
We introduce a measure for subspaces of a vector space over a $q$-element field, and propose some extremal problems for intersecting families. These are $q$-analogue of Erd\H{o}s-Ko-Rado type problems, and we answer some of the basic questions.
Externí odkaz:
http://arxiv.org/abs/2404.17385
Autor:
Tokushige, Norihide
Let ${\mathcal G}$ be a family of subsets of an $n$-element set. The family ${\mathcal G}$ is called $3$-wise $t$-intersecting if the intersection of any three subsets in ${\mathcal G}$ is of size at least $t$. For a real number $p\in(0,1)$ we define
Externí odkaz:
http://arxiv.org/abs/2304.13466
Autor:
Tokushige, Norihide
A family of $k$-element subsets of an $n$-element set is called 3-wise intersecting if any three members in the family have non-empty intersection. We determine the maximum size of such families exactly or asymptotically. One of our results shows tha
Externí odkaz:
http://arxiv.org/abs/2210.15361
Autor:
Sakurai, Taro, Tokushige, Norihide
We show that the expected number of cliques in the Erd\H{o}s-R\'enyi random graph $G(n,p)$ is $n^{\frac1{-2\log p}(\log n-2\log\log n+O(1))}$.
Comment: 4 pages
Comment: 4 pages
Externí odkaz:
http://arxiv.org/abs/2208.07492
Autor:
Tokushige, Norihide
Let $\mathcal G$ be a family of subsets of an $n$-element set. The family $\mathcal G$ is called non-trivial $3$-wise intersecting if the intersection of any three subsets in $\mathcal G$ is non-empty, but the intersection of all subsets is empty. Fo
Externí odkaz:
http://arxiv.org/abs/2203.17158
Autor:
Tokushige, Norihide
Publikováno v:
European Journal of Combinatorics 2023-05
Let $\mathcal G$ be a family of subsets of an $n$-element set. The family $\mathcal G$ is called $3$-wise $t$-intersecting if the intersection of any three subsets in $\mathcal G$ is of size at least $t$. For a real number $p\in(0,1)$ we define the m
Externí odkaz:
http://arxiv.org/abs/2112.08685
Autor:
Tokushige, Norihide
Using the Filmus-Golubev-Lifshitz method to bound the independence number of a hypergraph, we solve some problems concerning multiply intersecting families with biased measure. Among other results we obtain a stability result of a measure version of
Externí odkaz:
http://arxiv.org/abs/2112.07965
Autor:
Tokushige, Norihide1 (AUTHOR) hide@edu.u-ryukyu.ac.jp
Publikováno v:
Mathematical Programming. Mar2024, Vol. 204 Issue 1/2, p643-676. 34p.
