![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Norihide Tokushige
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j62]Norihide Tokushige
:
Strong stability of 3-wise t-intersecting families. Discret. Math. 347(5): 113930 (2024) - [j61]Norihide Tokushige
:
The maximum measure of non-trivial 3-wise intersecting families. Math. Program. 204(1): 643-676 (2024) - [i1]Norihide Tokushige:
Alon's transmitting problem and multicolor Beck-Spencer Lemma. CoRR abs/2406.19945 (2024) - 2023
- [j60]Norihide Tokushige
:
Non-trivial 3-wise intersecting uniform families. Discret. Math. 346(5): 113368 (2023) - [j59]Norihide Tokushige
:
The maximum measure of 3-wise t-intersecting families. Eur. J. Comb. 110: 103703 (2023) - 2021
- [j58]Masato Mimura, Norihide Tokushige
:
Solving linear equations in a vector space over a finite field. Discret. Math. 344(12): 112603 (2021) - [j57]Mitsuo Kato, Masashi Kosuda, Norihide Tokushige
:
Extending Muirhead's Inequality. Graphs Comb. 37(5): 1923-1941 (2021) - 2020
- [j56]Norihide Tokushige:
When are stars the largest cross-intersecting families? Discret. Math. 343(2): 111645 (2020)
2010 – 2019
- 2019
- [j55]Sang June Lee, Mark H. Siggers
, Norihide Tokushige
:
AK-type stability theorems on cross t-intersecting families. Eur. J. Comb. 82 (2019) - 2017
- [j54]Sangjune Lee, Mark H. Siggers
, Norihide Tokushige
:
Towards extending the Ahlswede-Khachatrian theorem to cross t-intersecting families. Discret. Appl. Math. 216: 627-645 (2017) - [j53]Peter Frankl, Norihide Tokushige
:
A note on Huang-Zhao theorem on intersecting families with large minimum degree. Discret. Math. 340(5): 1098-1103 (2017) - [j52]Sho Suda, Hajime Tanaka
, Norihide Tokushige
:
A semidefinite programming approach to a cross-intersection problem with measures. Math. Program. 166(1-2): 113-130 (2017) - 2016
- [j51]Peter Frankl, Norihide Tokushige
:
Uniform eventown problems. Eur. J. Comb. 51: 280-286 (2016) - [j50]Peter Frankl, Masashi Shinohara
, Norihide Tokushige
:
Multiply union families in Nn. Eur. J. Comb. 58: 66-74 (2016) - [j49]Peter Frankl, Norihide Tokushige
:
Intersection problems in the q-ary cube. J. Comb. Theory A 141: 90-126 (2016) - [j48]Peter Frankl, Norihide Tokushige
:
Invitation to intersection problems for finite sets. J. Comb. Theory A 144: 157-211 (2016) - 2014
- [j47]Peter Frankl, Sangjune Lee, Mark H. Siggers
, Norihide Tokushige
:
An Erdős-Ko-Rado theorem for cross t-intersecting families. J. Comb. Theory A 128: 207-249 (2014) - 2013
- [j46]Norihide Tokushige
:
Cross t-Intersecting Integer Sequences from Weighted Erdős-Ko-Rado. Comb. Probab. Comput. 22(4): 622-637 (2013) - [j45]Peter Frankl, Mitsuo Kato, Gyula O. H. Katona, Norihide Tokushige
:
Two-colorings with many monochromatic cliques in both colors. J. Comb. Theory B 103(4): 415-427 (2013) - [j44]Peter Frankl, Norihide Tokushige
:
The Katona theorem for vector spaces. J. Comb. Theory A 120(7): 1578-1589 (2013) - 2012
- [j43]Imre Bárány, Hiroshi Maehara, Norihide Tokushige
:
Tetrahedra passing through a triangular hole, and tetrahedra fixed by a planar frame. Comput. Geom. 45(1-2): 14-20 (2012) - [j42]Mark H. Siggers
, Norihide Tokushige
:
The maximum size of intersecting and union families of sets. Eur. J. Comb. 33(2): 128-138 (2012) - [j41]Tomoki Nakamigawa, Norihide Tokushige
:
Counting Lattice Paths via a New Cycle Lemma. SIAM J. Discret. Math. 26(2): 745-754 (2012) - 2011
- [j40]Peter Frankl, Norihide Tokushige
:
On r-Cross Intersecting Families of Sets. Comb. Probab. Comput. 20(5): 749-752 (2011) - [j39]Tomoki Nakamigawa, Norihide Tokushige
:
Counting lattice paths via a cycle lemma. Electron. Notes Discret. Math. 38: 675-680 (2011) - [j38]Hiroshi Maehara, Norihide Tokushige
:
Classification of the Congruent Embeddings of a Tetrahedron into a Triangular Prism. Graphs Comb. 27(3): 451-463 (2011) - [j37]Norihide Tokushige
:
A product version of the Erdős-Ko-Rado theorem. J. Comb. Theory A 118(5): 1575-1587 (2011) - 2010
- [j36]Norihide Tokushige
:
A multiply intersecting Erdos-Ko-Rado theorem - The principal case. Discret. Math. 310(3): 453-460 (2010) - [j35]Norihide Tokushige
:
On cross t-intersecting families of sets. J. Comb. Theory A 117(8): 1167-1177 (2010)
2000 – 2009
- 2009
- [j34]Hiroshi Maehara, Norihide Tokushige
:
From line-systems to sphere-systems - Schläfli's double six, Lie's line-sphere transformation, and Grace's theorem. Eur. J. Comb. 30(5): 1337-1351 (2009) - [j33]Hiroshi Maehara, Imre Z. Ruzsa, Norihide Tokushige
:
Large regular simplices contained in a hypercube. Period. Math. Hung. 58(1): 121-126 (2009) - 2008
- [j32]Norihide Tokushige
:
Brace-Daykin type inequalities for intersecting families. Eur. J. Comb. 29(1): 273-285 (2008) - 2007
- [j31]Norihide Tokushige
:
The maximum size of 3-wise t-intersecting families. Eur. J. Comb. 28(1): 152-166 (2007) - [j30]Norihide Tokushige
:
An extension of the Erdös-Ko-Rado Theorem. Electron. Notes Discret. Math. 28: 117-123 (2007) - [j29]Vojtech Rödl, Mathias Schacht
, Mark H. Siggers
, Norihide Tokushige
:
Integer and fractional packings of hypergraphs. J. Comb. Theory B 97(2): 245-268 (2007) - [j28]Norihide Tokushige
:
Multiply-intersecting families revisited. J. Comb. Theory B 97(6): 929-948 (2007) - [j27]Norihide Tokushige
:
EKR type inequalities for 4-wise intersecting families. J. Comb. Theory A 114(4): 575-596 (2007) - 2006
- [j26]Peter Frankl, Norihide Tokushige
:
Weighted Non-Trivial Multiply Intersecting Families. Comb. 26(1): 37-46 (2006) - [j25]Norihide Tokushige
:
The maximum size of 4-wise 2-intersecting and 4-wise 2-union families. Eur. J. Comb. 27(6): 814-825 (2006) - [j24]Peter Frankl, Norihide Tokushige
:
The Maximum Size of 3-Wise Intersecting and 3-Wise Union Families. Graphs Comb. 22(2): 225-231 (2006) - [j23]Norihide Tokushige
:
An L-system on the small Witt design. J. Comb. Theory A 113(3): 420-434 (2006) - 2005
- [j22]Peter Frankl, Norihide Tokushige
:
Random walks and multiply intersecting families. J. Comb. Theory A 109(1): 121-134 (2005) - 2004
- [j21]Imre Bárány, Norihide Tokushige
:
The Minimum Area of Convex Lattice n-Gons. Comb. 24(2): 171-185 (2004) - 2003
- [j20]Peter Frankl, Norihide Tokushige:
The game of n-times nim. Discret. Math. 260(1-3): 205-209 (2003) - 2002
- [j19]Yoshimi Egawa, Hikoe Enomoto, Norihide Tokushige:
Graph decompositions through prescribed vertices without isolates. Ars Comb. 62 (2002) - [j18]Peter Frankl, Norihide Tokushige
:
Weighted 3-Wise 2-Intersecting Families. J. Comb. Theory A 100(1): 94-115 (2002) - 2001
- [j17]Hiroshi Maehara, Norihide Tokushige
:
When does a planar bipartite framework admit a continuous deformation? Theor. Comput. Sci. 263(1-2): 345-354 (2001)
1990 – 1999
- 1999
- [j16]Peter Frankl, Norihide Tokushige
:
The Erdos-Ko-Rado Theorem for Integer Sequences. Comb. 19(1): 55-63 (1999) - 1998
- [j15]Peter Frankl, Katsuhiro Ota, Norihide Tokushige:
Uniform Intersecting Families with Covering Number Restrictions. Comb. Probab. Comput. 7(1): 47-56 (1998) - [j14]Peter Frankl, Norihide Tokushige:
Some Inequalities Concerning Cross-Intersecting Families. Comb. Probab. Comput. 7(3): 247-260 (1998) - 1997
- [j13]Hiroshi Maehara, Katsuhiro Ota, Norihide Tokushige
:
Every Graph Is an Integral Distance Graph in the Plane. J. Comb. Theory A 80(2): 290-294 (1997) - 1996
- [j12]Hiroshi Maehara, Norihide Tokushige:
A spatial unit-bar-framework which is rigid and triangle-free. Graphs Comb. 12(1): 341-344 (1996) - [j11]Peter Frankl, Katsuhiro Ota, Norihide Tokushige
:
Covers in Uniform Intersecting Families and a Counterexample to a Conjecture of Lovász. J. Comb. Theory A 74(1): 33-42 (1996) - [j10]Peter Frankl, Katsuhiro Ota, Norihide Tokushige
:
Exponents of Uniform L-Systems. J. Comb. Theory A 75(1): 23-43 (1996) - 1995
- [j9]Peter Frankl, Makoto Matsumoto, Imre Z. Ruzsa, Norihide Tokushige:
Minimum Shadows in Uniform Hypergraphs and a Generalization of the Takagi Function. J. Comb. Theory A 69(1): 125-148 (1995) - [j8]Peter Frankl, Katsuhiro Ota, Norihide Tokushige:
Uniform Intersecting Families with Covering Number Four. J. Comb. Theory A 71(1): 127-145 (1995) - 1993
- [j7]Peter Frankl, Norihide Tokushige
:
Weight functions on the kneser graph and the solution of an intersection problem of Sali. Comb. 13(4): 413-420 (1993) - 1992
- [j6]Hikoe Enomoto, Hajime Mizutani, Norihide Tokushige
:
A word problem in Artin semigroups. Discret. Math. 104(2): 159-166 (1992) - [j5]Mikio Kano, Norihide Tokushige
:
Binding numbers and f-factors of graphs. J. Comb. Theory B 54(2): 213-221 (1992) - [j4]Peter Frankl, Norihide Tokushige:
Some Best Possible Inequalities Concerning Cross-Intersecting Families. J. Comb. Theory A 61(1): 87-97 (1992)
1980 – 1989
- 1989
- [j3]Makoto Matsumoto, Norihide Tokushige
:
A generalization of the katona theorem for crosst-intersecting families. Graphs Comb. 5(1): 159-171 (1989) - [j2]Makoto Matsumoto, Norihide Tokushige
:
The exact bound in the Erdös-Ko-Rado theorem for cross-intersecting families. J. Comb. Theory A 52(1): 90-97 (1989) - [j1]Norihide Tokushige
:
Binding number and minimum degree for k-factors. J. Graph Theory 13(5): 607-617 (1989)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-25 20:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint