Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series A, Volume 141
Volume 141, July 2016
- Nabil H. Mustafa
, János Pach:
On the Zarankiewicz problem for intersection hypergraphs. 1-7 - Andrey Kupavskii:
On random subgraphs of Kneser and Schrijver graphs. 8-15 - Jianfeng Hou, Shufei Wu, Guiying Yan:
On judicious partitions of uniform hypergraphs. 16-32 - Cesar Ceballos, Tom Denton, Christopher R. H. Hanusa:
Combinatorics of the zeta map on rational Dyck paths. 33-77 - Wilfried Meidl:
Generalized Rothaus construction and non-weakly regular bent functions. 78-89 - Peter Frankl, Norihide Tokushige:
Intersection problems in the q-ary cube. 90-126 - Yaroslav Shitov:
A matrix ring with commuting graph of maximal diameter. 127-135 - Roman Glebov, Zur Luria:
On the maximum number of Latin transversals. 136-146 - Joel Lebowitz, Boris G. Pittel, D. Ruelle, E. R. Speer:
Central limit theorems, Lee-Yang zeros, and graph-counting polynomials. 147-183
a service of 
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.
last updated on 2024-07-09 22:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
