Norihide Tokushige - Concepedia

Author

Norihide Tokushige

University of the Ryukyus ORCID

Also Known As

N. TOKUSHIGE, N. Tokushige, NORIHIDE TOKUSHIGE, Norihide Tokushige, Tokushige, Norihide

131

Publications

977

Citations

H-Index

Concepts

All Affiliations

University of the Ryukyus Centre National de la Recherche Scientifique Meiji University Keio University Alfréd Rényi Institute of Mathematics

About

Norihide Tokushige is an author at University of the Ryukyus specializing in discrete mathematics, combinatorial optimization, and engineering.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	10	10	228
2	Combinatorial Optimization	10	10	270
3	Education	1	1	32
4	Probability Theory	1	1	12
5	Approximation Theory	1	1	31

Norihide Tokushige

Publications

724

Citations

H-Index

Page 1

	Year	Citations
The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families Makoto Matsumoto, Norihide Tokushige Journal of Combinatorial Theory Series A Combinatorial DesignExtremal Set TheoryExtremal CombinatoricsEnumerative GeometryDiscrete Mathematics	1989	83
Some best possible inequalities concerning cross-intersecting families Péter Frankl, Norihide Tokushige Journal of Combinatorial Theory Series A Best Possible InequalitiesCombinatorial DesignExtremal Set TheoryExtremal CombinatoricsDiscrete Mathematics	1992	68
The Erdős-Ko-Rado Theorem for Integer Sequences Péter Frankl, Norihide Tokushige COMBINATORICA Integer SequencesComputational Number TheoryAnalytic Number TheoryAnalytic CombinatoricsDiscrete Mathematics	1999	59
Invitation to intersection problems for finite sets Péter Frankl, Norihide Tokushige Journal of Combinatorial Theory Series A Mathematical ProgrammingEngineeringCombinatorial DesignExtremal Set TheoryExtremal Combinatorics	2016	57
Covers in Uniform Intersecting Families and a Counterexample to a Conjecture of Lovász Péter Frankl, Katsuhiro Ota, Norihide Tokushige Journal of Combinatorial Theory Series A Combinatorial DesignExtremal Set TheorySet-theoretic TopologyTopological CombinatoricsEnumerative Geometry	1996	37
Binding numbers and f-factors of graphs Mikio Kanō, Norihide Tokushige Journal of Combinatorial Theory Series B Graph TheoryAlgebraic Graph TheoryStructural Graph TheoryEducationNetwork Analysis	1992	32
An Erdős–Ko–Rado theorem for cross t-intersecting families Péter Frankl, Sang June Lee, Mark Siggers, Journal of Combinatorial Theory Series A Enumerative GeometryCross T-intersecting Families	2014	31
The eigenvalue method for cross t-intersecting families Norihide Tokushige Journal of Algebraic Combinatorics Spectral TheoryNumerical AnalysisMathematical ProgrammingEngineeringMatrix Method	2013	31
The Minimum Area of Convex Lattice n -Gons Norihide Tokushige, Imre B�r�ny COMBINATORICA Mathematical ProgrammingEngineeringLattice (Order)Convex HullDiscrete Mathematics	2004	27
Minimum shadows in uniform hypergraphs and a generalization of the Takagi function Péter Frankl, Makoto Matsumoto, Imre Z. Ruzsa, Journal of Combinatorial Theory Series A Graph TheoryExtremal CombinatoricsHypergraph TheoryDiscrete MathematicsExtremal Graph Theory	1995	27

Page 1