Norihide Tokushige

Orcid: 0000-0002-9487-7545

According to our database1, Norihide Tokushige authored at least 62 papers between 1989 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


Online presence:



The maximum measure of non-trivial 3-wise intersecting families.
Math. Program., March, 2024

Strong stability of 3-wise t-intersecting families.
Discret. Math., 2024

The maximum measure of 3-wise t-intersecting families.
Eur. J. Comb., May, 2023

Non-trivial 3-wise intersecting uniform families.
Discret. Math., May, 2023

Extending Muirhead's Inequality.
Graphs Comb., 2021

Solving linear equations in a vector space over a finite field.
Discret. Math., 2021

When are stars the largest cross-intersecting families?
Discret. Math., 2020

AK-type stability theorems on cross t-intersecting families.
Eur. J. Comb., 2019

A semidefinite programming approach to a cross-intersection problem with measures.
Math. Program., 2017

A note on Huang-Zhao theorem on intersecting families with large minimum degree.
Discret. Math., 2017

Towards extending the Ahlswede-Khachatrian theorem to cross t-intersecting families.
Discret. Appl. Math., 2017

Invitation to intersection problems for finite sets.
J. Comb. Theory A, 2016

Intersection problems in the q-ary cube.
J. Comb. Theory A, 2016

Uniform eventown problems.
Eur. J. Comb., 2016

Multiply union families in N<sup>n</sup>.
Eur. J. Comb., 2016

An Erdős-Ko-Rado theorem for cross t-intersecting families.
J. Comb. Theory A, 2014

The Katona theorem for vector spaces.
J. Comb. Theory A, 2013

Two-colorings with many monochromatic cliques in both colors.
J. Comb. Theory B, 2013

Cross <i>t</i>-Intersecting Integer Sequences from Weighted Erdős-Ko-Rado.
Comb. Probab. Comput., 2013

Counting Lattice Paths via a New Cycle Lemma.
SIAM J. Discret. Math., 2012

The maximum size of intersecting and union families of sets.
Eur. J. Comb., 2012

Tetrahedra passing through a triangular hole, and tetrahedra fixed by a planar frame.
Comput. Geom., 2012

A product version of the Erdős-Ko-Rado theorem.
J. Comb. Theory A, 2011

Classification of the Congruent Embeddings of a Tetrahedron into a Triangular Prism.
Graphs Comb., 2011

Counting lattice paths via a cycle lemma.
Electron. Notes Discret. Math., 2011

On <i>r</i>-Cross Intersecting Families of Sets.
Comb. Probab. Comput., 2011

On cross t-intersecting families of sets.
J. Comb. Theory A, 2010

A multiply intersecting Erdos-Ko-Rado theorem - The principal case.
Discret. Math., 2010

Large regular simplices contained in a hypercube.
Period. Math. Hung., 2009

From line-systems to sphere-systems - Schläfli's double six, Lie's line-sphere transformation, and Grace's theorem.
Eur. J. Comb., 2009

Brace-Daykin type inequalities for intersecting families.
Eur. J. Comb., 2008

Multiply-intersecting families revisited.
J. Comb. Theory B, 2007

EKR type inequalities for 4-wise intersecting families.
J. Comb. Theory A, 2007

Integer and fractional packings of hypergraphs.
J. Comb. Theory B, 2007

An extension of the Erdös-Ko-Rado Theorem.
Electron. Notes Discret. Math., 2007

The maximum size of 3-wise <i>t</i>-intersecting families.
Eur. J. Comb., 2007

An <i>L</i>-system on the small Witt design.
J. Comb. Theory A, 2006

The Maximum Size of 3-Wise Intersecting and 3-Wise Union Families.
Graphs Comb., 2006

The maximum size of 4-wise 2-intersecting and 4-wise 2-union families.
Eur. J. Comb., 2006

Weighted Non-Trivial Multiply Intersecting Families.
Comb., 2006

Random walks and multiply intersecting families.
J. Comb. Theory A, 2005

The Minimum Area of Convex Lattice <i>n</i>-Gons.
Comb., 2004

The game of <i>n</i>-times nim.
Discret. Math., 2003

Weighted 3-Wise 2-Intersecting Families.
J. Comb. Theory A, 2002

Graph decompositions through prescribed vertices without isolates.
Ars Comb., 2002

When does a planar bipartite framework admit a continuous deformation?
Theor. Comput. Sci., 2001

The Erdos-Ko-Rado Theorem for Integer Sequences.
Comb., 1999

Some Inequalities Concerning Cross-Intersecting Families.
Comb. Probab. Comput., 1998

Uniform Intersecting Families with Covering Number Restrictions.
Comb. Probab. Comput., 1998

Every Graph Is an Integral Distance Graph in the Plane.
J. Comb. Theory A, 1997

Covers in Uniform Intersecting Families and a Counterexample to a Conjecture of Lovász.
J. Comb. Theory A, 1996

Exponents of Uniform L-Systems.
J. Comb. Theory A, 1996

A spatial unit-bar-framework which is rigid and triangle-free.
Graphs Comb., 1996

Uniform Intersecting Families with Covering Number Four.
J. Comb. Theory A, 1995

Minimum Shadows in Uniform Hypergraphs and a Generalization of the Takagi Function.
J. Comb. Theory A, 1995

Weight functions on the kneser graph and the solution of an intersection problem of Sali.
Comb., 1993

Binding numbers and <i>f</i>-factors of graphs.
J. Comb. Theory B, 1992

Some Best Possible Inequalities Concerning Cross-Intersecting Families.
J. Comb. Theory A, 1992

A word problem in Artin semigroups.
Discret. Math., 1992

Binding number and minimum degree for k-factors.
J. Graph Theory, 1989

The exact bound in the Erdös-Ko-Rado theorem for cross-intersecting families.
J. Comb. Theory A, 1989

A generalization of the katona theorem for cross<i>t</i>-intersecting families.
Graphs Comb., 1989