Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 40
Volume 40, Number 1, 1982
- Richard P. Anstee:
Triangular (0, 1)-matrices with prescribed row and column sums. 1-10 - S. A. Burr:
Multicolor Ramsey numbers involving graphs with long suspended paths. 11-20 - Joel E. Cohen:
The asymptotic probability that a random graph is a unit interval graph, indifference graph, or proper interval graph. 21-24 - Richard W. Cottle:
Minimal triangulation of the 4-cube. 25-29 - Jean-Pierre Duval:
Relationship between the period of a finite word and the length of its unbordered segments. 31-44 - Paul Erdös, George B. Purdy, Ernst G. Straus:
On a problem in combinatorial geometry. 45-52 - Zoltán Füredi:
Set-systems with prescribed cardinalities for pairwise intersections. 53-67 - Ira M. Gessel:
A q-analog of the exponential formula. 69-80 - John F. Sallee:
A triangulation of the n-cube. 81-86 - Douglas B. West:
A class of solutions to the gossip problem, part II. 87-113 - Jacqueline Ayel:
Longest paths in bipartite digraphs. 115-118 - Ilker Baybars:
On k-path hamiltonian maximal planar graphs. 119-121 - Samira Kettoola, J. D. Roberts:
Some results on Ramsey numbers using sumfree sets. 123-124
Volume 40, Numbers 2-3, 1982
- Alphonse Baartmans, Mohan S. Shrikhande:
Designs with no three mutually disjoint blocks. 129-139 - Imre Bárány:
A generalization of carathéodory's theorem. 141-152 - Thien Tran Cong, Masako Sato:
One-dimensional random walk with unequal step lengths restricted by an absorbing barrier. 153-162 - Raul Cordovil:
Sur un theoreme de separation des matroïdes orientes de rang trois. 163-169 - Paul H. Edelman
:
Multichains, non-crossing partitions and trees. 171-179 - Peter C. Fishburn:
Aspects of semiorders within interval orders. 181-191 - Egbert Harzheim:
Combinatorial theorems on contractive mappings in power sets. 193-201 - F. Hering, Ronald C. Read, Geoffrey C. Shephard:
The enumeration of stack polytopes and simplical clusters. 203-217 - Peter D. Johnson Jr.:
Coloring abelian groups. 219-223 - R. Kemp:
On the number of words in the language {w in sigma* | W = wR}2. 225-234 - Zevi Miller:
Extremal regular graphs for the achromatic number. 235-253 - Aeryung Moon:
An embedding theorem for affine resolvable designs. 255-259 - Cees Roos, Cornelis de Vroedt:
Upper bounds for A(n, 4) and A(n, 6) derived from Delsarte's linear programming bound. 261-276 - Nicolae Tandareanu:
On generalized Boolean functions II. 277-284 - Douglas B. West:
A class of solutions to the gossip problem, part III. 285-310 - William O. J. Moser:
A generalization of Riordan's formula for 3xn latin rectangles. 311-313 - Wenceslas Fernandez de la Vega:
Sur la cardinalite maximum des couplages d'hypergraphes aleatoires uniformes. 315-318 - P. N. Walton, D. J. A. Welsh:
Tangential 1-blocks over GF(3). 319-320
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-04-22 20:03 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:
