Degree

• Doctor(Science)（Waseda University）

Research History

Education

Awards

• 小野梓記念学術賞（1993）
• Onoazusa Memorial Award(Academic Award)（1993）
• 大川功賞（1992）
• Isao OKAWA Award（1992）

Others

Papers

• VC-dimensions of finite automata and commutative finite automata with k letters and n states（1997-05） [Web of Scientce]

Misc

• 離散構造の中の擬ランダム性（Szemerediの一様化補題、ランダムサンプリング、プロパティテスト、ラムゼー理論）（2008）
• Quasi-randomness in discrete structures (Szemeredi's regularity lemma, random samplings, property tests, Ramsey theory)（2008）
• Linear Ramsey Numbers for Bounded-Degree Hypergrahps（2007-08-15） [DOI]
• Linear Ramsey Numbers for Bounded-Degree Hypergraphs（2007） [DOI]
• グラフとその周辺におけるランダム構造の話（2006）
• Random structures around graph theory（2006）
• Dense graphs and pseudo-randomness（2005）
• Dense graphs and pseudo-randomness（2005）
• Random graphs and pseudo-random graphs I,II,III（2004）
• Vertex-disjoint cycles containing prescribed vertices（2003-04） [DOI] [Web of Scientce]
• An analytic study of substructures of abstract graphs（2003）
• Spanning subgraphs in dense graphs（2003）
• An analytic study of substructures of abstract graphs（2003）
• Spanning subgraphs in dense graphs（2003）
• Proof of a conjecture of Bollobas and Kohayakawa on the Erdos-Stone theorem（2002-07） [DOI] [Web of Scientce]
• Almost-spanning subgraphs with bounded degree in dense graphs（2002-07） [DOI] [Web of Scientce]
• A common extension of the Erdos-Stone theorem and the Alon-Yuster theorem for unbounded graphs（2002-05） [DOI] [Web of Scientce]
• An extension of a theorem on cycles containing specified independent edges（2002-02） [DOI] [Web of Scientce]
• 極値グラフ理論における擬確率的手法（2002）
• On the regularity lemma（2002）
• Proof of a conjecture of Bollobás and Kohayakawa on the Erdos-Stone theorem（2002） [DOI]
• A common extension of the Erdos-Stone theorem and the Alon-Yuster theorem for unbounded graphs（2002） [DOI]
• Almost-spanning subgraphs with bounded degree in dense graphs（2002） [DOI]
• The pseudo-probabilistic method in extremal graph theory（2002）
• On the regularity lemma（2002）
• Vertex-disjoint cycles of length at most four each of which contains a specified vertex（2001-05） [Web of Scientce]
• Subgraphs in Dense Graphs and Szemeredi's Regularity Lemma（2001）
• A modern method for a wide range of classical problems in graph theory - the pseudo-probabilistic method（2001）
• Extending Alon-Yuster's packing theorem（2001）
• Almost-spanning subgraphs in dense graphs（2001）
• Subgraphs in Dense Graphs and Szemeredi's Regularity Lemma（2001）
• A modern method for a wide range of classical problems in graph theory - the pseudo-probabilistic method（2001）
• Extending Alon-Yuster's packing theorem（2001）
• Almost-spanning subgraphs in dense graphs（2001）
• Vertex-disjoint cycles of length at most four each of which contains a specified vertex（2001） [DOI]
• How many diagonal rectangles are needed to cover an orthogonal polygon?（2000-07） [Web of Scientce]
• Proof of a Bollobas-Kohayakawa Conjecture on the Erdos-Stone Theorem（2000）
• How many diagonal rectangles are needed to cover an orthogonal polygon?（2000）
• Proof of a Bollobas-Kohayakawa Conjecture on the Erdos-Stone Theorem（2000）
• Vertex-disjoint cycles containing specified edges（2000） [DOI] [Web of Scientce]
• Performance comparison of recognition systems: a Bayesian approach（1999） [DOI]
• Performance comparison of recognition systems: a Bayesian approach（1999） [DOI]
• Performance comparison of recognition systems : A Bayesian approach（1998） [CiNii Research (CiNii Articles)]
• Performance comparison of recognition systems: a Bayesian approach（1998）
• VC-dimensions of finite automata and commutative finite automata with k letters and n states（1997-04） [Web of Scientce]
• 組み合わせ論における手法と道具（1997）
• Methods and tools in combinatorics（1997）
• VC-dimensions of finite automata and commutative finite automata with $k$ letters and $n$ states（1997）
• An extremal problem of d permutations containing every permutation of every t elements（1996-11） [Web of Scientce]
• The wide-diameter of the n-dimensional toroidal mesh（1996-07） [CiNii Research (CiNii Articles)] [DOI] [Web of Scientce]
• On circles containing the maximum number of points（1996-05） [Web of Scientce]
• The wide-diameter of the n-dimensional toroidal mesh（1996） [CiNii Research (CiNii Articles)] [DOI]
• An extremal problem of $d$ permutations containing every permutation of every $t$ elements（1996）
• Containment problems in high-dimensional spaces（1995-12） [DOI]
• 高次元空間における点と直方体の組合せ論（1995）
• Containment problems in high-dimensional spaces（1995） [DOI] [Web of Scientce]
• AN EXTREMAL PROBLEM OF ORTHANTS CONTAINING AT MOST ONE-POINT BESIDES THE ORIGIN（1994-09） [Web of Scientce]
• Extremal Problems and Ramsey Properties of Ball, Box or Orthant containing many points in $R^d$ - And Combinatorics of Permutations(Computational Geometry and Discrete Geometry)（1994-05） [CiNii Research (CiNii Articles)] [CiNii Books] [Othres link]
• An extremal problem of orthants containing at most one point besides the origin（1994）
• SOME ASYMPTOTIC CONDITIONS OF WORLDLINES IN MINKOWSKI SPACE（1993-05） [DOI] [Web of Scientce]
• The VC-dimensions of finite automata with n states（1993）
• The VC-dimensions of finite automata with n states（1993）

Presentations

Books and Other Publications

• Improvement of the Erdos-Stone Theorem（2000）
• Improvement of the Erdos-Stone Theorem（2000）

Works

Research Projects

Media Coverage

Industrial Property Rights

Professional Memberships

• American Mathematical Society
• 日本数学会
• American Mathematical Society

Committee Memberships

Teaching Experience

Social Contribution

Academic Contribution