Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Electronic Journal of Combinatorics, Volume 7
Volume 7, 2000
- Hadi Kharaghani:
On the Twin Designs with the Ionin-type Parameters. - Eric Mendelsohn, Gaetano Quattrocchi:
Resolving Triple Systems into Regular Configurations. - Niklas Eriksen, Henrik Eriksson, Kimmo Eriksson:
Diagonal Checker-jumping and Eulerian Numbers for Color-signed Permutations. - Vsevolod F. Lev:
Restricted set addition in groups, II. A generalization of the Erdo"s-Heilbronn conjecture. - Boris G. Pittel:
Where the Typical Set Partitions Meet and Join. - David Savitt, Richard P. Stanley:
A Note on the Symmetric Powers of the Standard Representation of Sn. - Magnús M. Halldórsson:
Online Coloring Known Graphs. - Lisa McShine:
Random Sampling of Labeled Tournaments. - Rodica Simion:
Combinatorial statistics on type-B analogues of noncrossing partitions and restricted permutations. - C. H. C. Little, A. E. Campbell:
Evolutionary Familes of Sets. - Thomas Honold, Ivan N. Landjev:
Linear Codes over Finite Chain Rings. - Elias M. Hagos:
The Characteristic Polynomial of a Graph is Reconstructible from the Characteristic Polynomials of its Vertex-Deleted Subgraphs and Their Complements. - Malcolm Greig:
Some Pairwise Balanced Designs. - André Bouchet, Bill Jackson:
Parity Systems and the Delta-Matroid Intersection Problem. - Vince Grolmusz:
Low Rank Co-Diagonal Matrices and Ramsey Graphs. - Petra M. Gleiss, Josef Leydold, Peter F. Stadler
:
Interchangeability of Relevant Cycles in Graphs. - Toufik Mansour, Alek Vainshtein:
Restricted Permutations, Continued Fractions, and Chebyshev Polynomials. - Béla Bollobás, Oliver Riordan:
Constrained Graph Processes. - Tom Bohman, Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma:
Note on Sparse Random Graphs and Cover Graphs. - Robert Milson:
Composition Sum Identities Related to the Distribution of Coordinate Values in a Discrete Simplex. - André Poenitz, Peter Tittmann:
Improved Upper Bounds for Self-Avoiding Walks in Zd. - Edward Spence:
The Strongly Regular (40, 12, 2, 4) Graphs. - Robert Gill:
The Action of the Symmetric Group on a Generalized Partition Semilattice. - Albin L. Jones:
A Short Proof of a Partition Relation for Triples. - Richard W. Kenyon, James Gary Propp, David Bruce Wilson:
Trees and Matchings. - Tom Bohman, Colin Cooper, Alan M. Frieze:
Min-Wise Independent Linear Permutations. - Christian Krattenthaler:
Bijections for Hook Pair Identities. - Alexei Borodin, Grigori Olshanski:
Harmonic Functions on Multiplicative Graphs and Interpolation Polynomials. - Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou:
A Note on the Non-Colorability Threshold of a Random Graph. - Tomasz Schoen:
A Note on the Number of (k, l)-Sum-Free Sets. - Sergei Evdokimov, Ilia N. Ponomarenko:
Separability Number and Schurity Number of Coherent Configurations. - Harold Fredricksen, Melvin M. Sweet:
Symmetric Sum-Free Partitions and Lower Bounds for Schur Numbers. - Jason P. Bell, Edward A. Bender, Peter J. Cameron, L. Bruce Richmond:
Asymptotics for the Probability of Connectedness and the Distribution of Number of Components. - Martin Klazar:
Counting Pattern-free Set Partitions II: Noncrossing and Other Hypergraphs. - Marc A. A. van Leeuwen:
Some Bijective Correspondences Involving Domino Tableaux. - Jason P. Bell:
When Structures Are Almost Surely Connected. - Benjamin Wieland:
Large Dihedral Symmetry of the Set of Alternating Sign Matrices. - László Babai, Peter J. Cameron:
Automorphisms and Enumeration of Switching Classes of Tournaments. - Charles Knessl, Wojciech Szpankowski:
A Note on the Asymptotic Behavior of the Heights in b-Tries for b Large. - Robert A. Sulanke:
Counting Lattice Paths by Narayana Polynomials. - Alan M. Frieze, Miklós Ruszinkó, Lubos Thoma:
A Note on Random Minimum Length Spanning Trees. - Holger Glaab, Alexander Pott:
The Hamiltonian p-Median Problem. - Paul J. Tanenbaum:
Bound Graph Polysemy. - Matthew Cook, Michael Kleber:
Tournament Sequences and Meeussen Sequences. - Mahendra Jani, Robert G. Rieper:
Continued Fractions and Catalan Problems. - David W. Boll, Jerry Donovan, Ronald L. Graham, Boris D. Lubachevsky:
Improving Dense Packings of Equal Disks in a Square. - Yair Caro, Raphael Yuster:
A Tura'n Type Problem Concerning the Powers of the Degrees of a Graph. - Benjamin Doerr:
Linear Discrepancy of Basic Totally Unimodular Matrices. - Randall McCutcheon:
Two New Extensions of the Hales-Jewett Theorem. - Lane H. Clark:
An Asymptotic Expansion for the Number of Permutations with a Certain Number of Inversions. - Miguel Angel Fiol:
Quasi-Spectral Characterization of Strongly Distance-Regular Graphs. - Taras O. Banakh, Oleg V. Verbitsky, Yaroslav Vorobets:
A Ramsey Treatment of Symmetry. - Mike Develin:
A Complete Categorization of When Generalized Tribonacci Sequences Can Be Avoided by Additive Partitions. - Robin J. Chapman:
Franklin's Argument Proves an Identity of Zagier. - D. de Caen:
Large Equiangular Sets of Lines in Euclidean Space. - Vassili C. Mavron:
Frequency Squares and Affine Designs. - Alan M. Frieze:
On the Number of Perfect Matchings and Hamilton Cycles in e-Regular Non-bipartite Graphs. - William Edwin Clark, Larry A. Dunning, Stephen Suen:
Tight Upper Bounds for the Domination Numbers of Graphs with Given Order and Minimum Degree, II. - Peter A. Hästö:
On Descents in Standard Young Tableaux. - André Kündgen, Eric Mendelsohn, Vitaly I. Voloshin:
Colouring Planar Mixed Hypergraphs.
- Luc Lapointe, Alain Lascoux, Jennifer Morse:
Determinantal Expression and Recursion for Jack Polynomials. - Daniel A. Spielman, Miklós Bóna:
An Infinite Antichain of Permutations. - Vera Rosta:
Note on Gy. Elekes's Conjectures Concerning Unavoidable Patterns in Proper Colorings. - William Edwin Clark, Stephen Suen:
Inequality Related to Vizing's Conjecture. - Vassili C. Mavron:
A Construction Method for Complete Sets of Mutually Orthogonal Frequency Squares. - Tewodros Amdeberhan:
A Determinant of the Chudnovskys Generalizing the Elliptic Frobenius-Stickelberger-Cauchy Determinantal Identity.
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:
