MKMikio Kano
Mikio Kano
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Mikio Kano has a total of 37 co-authors. Here are the top co-authors by number of shared publications:
- Jin Akiyama
Tokyo University of Science
8 shared publications - Sergey Bereg
Department of Computer Science, University of Texas at Dallas, P.O. Box 830688, Richardson, TX 75083, USA
4 shared publications - Jorge Urrutia
Instituto de Matemáticas, Universidad Nacional Autónoma de México, Mexico City, Mexico
3 shared publications - Carlos Seara
Departament de Matemàtiques, Universitat Politècnica de Catalunya, Barcelona, Spain
2 shared publications - Dolores Lara
Centro de Investigación y de Estudios Avanzados del Instituto Politécnico Nacional
2 shared publications - Fiama Pierina Orejuela Hurtado
Departament de Matemàtica Aplicada II Universitat Politècnica de Catalunya Barcelona Spain
2 shared publications
Latest Publications
- Open Access
The hamburger theorem
We generalize the ham sandwich theorem to $d+1$ measures in $\mathbb{R}^d$ as follows. Let $\mu_1,\mu_2, \dots, \mu_{d+1}$ be absolutely continuous finite Borel measures on $\mathbb{R}^d$. Let $\omega_i=\mu_i(\mathbb{R}^d)$ for $i\in [d+1]$, $\omega=\min\{\omega_i; i\in [d+1]\}$ and assume that $\sum_{j=1}^{d+1} \omega_j=1$. Assume that $\omega_i \le 1/d$ for every $i\in[d+1]$. Then there exists a hyperplane $h$ such that each open halfspace $H$ defined by $h$ satisfies $\mu_i(H) \le (\sum_{j=1}^{d+1} \mu_j(H))/d$ for every $i \in [d+1]$ and $\sum_{j=1}^{d+1} \mu_j(H) \ge \min(1/2, 1-d\omega) \ge 1/(d+1)$. As a consequence we obtain that every $(d+1)$-colored set of $nd$ points in $\mathbb{R}^d$ such that no color is used for more than $n$ points can be partitioned into $n$ disjoint rainbow $(d-1)$-dimensional simplices.Open AccessThe hamburger theorem
We generalize the ham sandwich theorem to $d+1$ measures in $\mathbb{R}^d$ as follows. Let $\mu_1,\mu_2, \dots, \mu_{d+1}$ be absolutely continuous finite Borel measures on $\mathbb{R}^d$. Let $\omega_i=\mu_i(\mathbb{R}^d)$ for $i\in [d+1]$, $\omega=\min\{\omega_i; i\in [d+1]\}$ and assume that $\sum_{j=1}^{d+1} \omega_j=1$. Assume that $\omega_i \le 1/d$ for every $i\in[d+1]$. Then there exists a hyperplane $h$ such that each open halfspace $H$ defined by $h$ satisfies $\mu_i(H) \le (\sum_{j=1}^{d+1} \mu_j(H))/d$ for every $i \in [d+1]$ and $\sum_{j=1}^{d+1} \mu_j(H) \ge \min(1/2, 1-d\omega) \ge 1/(d+1)$. As a consequence we obtain that every $(d+1)$-colored set of $nd$ points in $\mathbb{R}^d$ such that no color is used for more than $n$ points can be partitioned into $n$ disjoint rainbow $(d-1)$-dimensional simplices. - Open Access
Balanced partitions of 3-colored geometric sets in the plane
Let $S$ be a finite set of geometric objects partitioned into classes or \emph{colors}. A subset $S'\subseteq S$ is said to be \emph{balanced} if $S'$ contains the same amount of elements of $S$ from each of the colors. We study several problems on partitioning $3$-colored sets of points and lines in the plane into two balanced subsets: (a) We prove that for every 3-colored arrangement of lines there exists a segment that intersects exactly one line of each color, and that when there are $2m$ lines of each color, there is a segment intercepting $m$ lines of each color. (b) Given $n$ red points, $n$ blue points and $n$ green points on any closed Jordan curve $\gamma$, we show that for every integer $k$ with $0 \leq k \leq n$ there is a pair of disjoint intervals on $\gamma$ whose union contains exactly $k$ points of each color. (c) Given a set $S$ of $n$ red points, $n$ blue points and $n$ green points in the integer lattice satisfying certain constraints, there exist two rays with common apex, one vertical and one horizontal, whose union splits the plane into two regions, each one containing a balanced subset of $S$.Open AccessBalanced partitions of 3-colored geometric sets in the plane
Let $S$ be a finite set of geometric objects partitioned into classes or \emph{colors}. A subset $S'\subseteq S$ is said to be \emph{balanced} if $S'$ contains the same amount of elements of $S$ from each of the colors. We study several problems on partitioning $3$-colored sets of points and lines in the plane into two balanced subsets: (a) We prove that for every 3-colored arrangement of lines there exists a segment that intersects exactly one line of each color, and that when there are $2m$ lines of each color, there is a segment intercepting $m$ lines of each color. (b) Given $n$ red points, $n$ blue points and $n$ green points on any closed Jordan curve $\gamma$, we show that for every integer $k$ with $0 \leq k \leq n$ there is a pair of disjoint intervals on $\gamma$ whose union contains exactly $k$ points of each color. (c) Given a set $S$ of $n$ red points, $n$ blue points and $n$ green points in the integer lattice satisfying certain constraints, there exist two rays with common apex, one vertical and one horizontal, whose union splits the plane into two regions, each one containing a balanced subset of $S$. - 6 June 2016
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 32 (6) , 2315-2322
Generalizations of Marriage Theorem for Degree Factors
- 6 June 2016
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 32 (6) , 2315-2322
Generalizations of Marriage Theorem for Degree Factors
- 20 August 2015
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 31 (6) , 1883-1887
Spanning Trees Whose Stems are Spiders
- 20 August 2015
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 31 (6) , 1883-1887
Spanning Trees Whose Stems are Spiders
- 10 March 2015
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 32 (1) , 103-110
$(1,f)$ ( 1 , f ) -Factors of Graphs with Odd Property- 10 March 2015
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 32 (1) , 103-110
$(1,f)$ ( 1 , f ) -Factors of Graphs with Odd Property- Open Access
- 2 January 2015
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 22 (1) , P1.13
Spanning $k$-trees of Bipartite Graphs
A tree is called a $k$-tree if its maximum degree is at most $k$. We prove the following theorem. Let $k \geq 2$ be an integer, and $G$ be a connected bipartite graph with bipartition $(A,B)$ such that $|A| \le |B| \le (k-1)|A|+1$. If $\sigma_k(G) \ge |B|$, then $G$ has a spanning $k$-tree, where $\sigma_k(G)$ denotes the minimum degree sum of $k$ independent vertices of $G$. Moreover, the condition on $\sigma_k(G)$ is sharp. It was shown by Win (Abh. Math. Sem. Univ. Hamburg, 43, 263–267, 1975) that if a connected graph $H$ satisfies $\sigma_k(H) \ge |H|-1$, then $H$ has a spanning $k$-tree. Thus our theorem shows that the condition becomes much weaker if the graph is bipartite.- 2 January 2015
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 22 (1) , P1.13
Open AccessSpanning $k$-trees of Bipartite Graphs
A tree is called a $k$-tree if its maximum degree is at most $k$. We prove the following theorem. Let $k \geq 2$ be an integer, and $G$ be a connected bipartite graph with bipartition $(A,B)$ such that $|A| \le |B| \le (k-1)|A|+1$. If $\sigma_k(G) \ge |B|$, then $G$ has a spanning $k$-tree, where $\sigma_k(G)$ denotes the minimum degree sum of $k$ independent vertices of $G$. Moreover, the condition on $\sigma_k(G)$ is sharp. It was shown by Win (Abh. Math. Sem. Univ. Hamburg, 43, 263–267, 1975) that if a connected graph $H$ satisfies $\sigma_k(H) \ge |H|-1$, then $H$ has a spanning $k$-tree. Thus our theorem shows that the condition becomes much weaker if the graph is bipartite. - 1 January 2015
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 181, 21-32
Balanced partitions of 3-colored geometric sets in the plane
- 1 January 2015
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 181, 21-32
Balanced partitions of 3-colored geometric sets in the plane
- 18 May 2013
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 30 (4) , 821-826
{k, r – k}-Factors of r-Regular Graphs
- 18 May 2013
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 30 (4) , 821-826
{k, r – k}-Factors of r-Regular Graphs
- 29 October 2012
- Published by Springer Nature
- p. 355-369
Discrete Geometry on Red and Blue Points in the Plane Lattice
- 29 October 2012
- Published by Springer Nature
- p. 355-369
Discrete Geometry on Red and Blue Points in the Plane Lattice