Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Electronic Journal of Combinatorics, Volume 8
Volume 8, Number 1, 2001
- Anthony Bonato, Wolf H. Holzmann, Hadi Kharaghani:
Hadamard Matrices and Strongly Regular Graphs with the 3-e.c. Adjacency Property. - Dan Singer:
On Catalan Trees and the Jacobian Conjecture. - Leigh Roberts:
A Unified View of Determinantal Expansions for Jack Polynomials. - Richard P. Anstee, Ron Ferguson, Attila Sali:
Small Forbidden Configurations II. - Andrew Granville
, John L. Selfridge:
Product of Integers in an Interval, Modulo Squares. - Giovanni Lo Faro, Lorenzo Milazzo, Antoinette Tripodi:
On the Upper and Lower Chromatic Numbers of BSQSs(16). - Thomas Niessen:
How to Find Overfull Subgraphs in Graphs with Large Maximum Degree, II. - Eric Vigoda:
A Note on the Glauber Dynamics for Sampling Independent Sets. - Gábor N. Sárközy, Stanley M. Selkow:
On Edge Colorings with at Least q Colors in Every Subset of p Vertices. - Stefan Felsner:
The Skeleton of a Reduced Word and a Correspondence of Edelman and Greene. - Mark Skandera:
Dumont's Statistic on Words. - Yury J. Ionin:
Applying Balanced Generalized Weighing Matrices to Construct Block Designs. - Fan R. K. Chung, Ronald L. Graham, Frank Thomson Leighton:
Guessing Secrets. - Philippe Chassaing, Jean-François Marckert:
Parking Functions, Empirical Processes, and the Width of Rooted Labeled Trees. - E. Rodney Canfield:
Meet and Join within the Lattice of Set Partitions. - Markus Fulmek, Michael Kleber:
Bijective Proofs for Schur Function Identities which Imply Dodgson's Condensation - Formula and Plu"cker Relations. - Yair Caro, Cecil C. Rousseau:
Asymptotic Bounds for Bipartite Ramsey Numbers. - James Gary Propp:
A Reciprocity Theorem for Domino Tilings. - Yifan Yang:
On a Multiplicative Partition Function. - Bojan Mohar, Riste Skrekovski:
Nowhere-zero k-flows of Supergraphs. - Mark Shimozono, Dennis E. White:
A Color-to-Spin Domino Schensted Algorithm. - Ara Aleksanyan, Mihran Papikian:
On Coset Coverings of Solutions of Homogeneous Cubic Equations over Finite Fields. - Alex Brodsky, Stephane Durocher, Ellen Gethner:
The Rectilinear Crossing Number of K10 is 62. - Gaetano Quattrocchi:
Colouring 4-cycle Systems with Specified Block Colour Patterns: the Case of Embedding P3-designs. - Xuding Zhu:
Circular Chromatic Number of Planar Graphs of Large Odd Girth. - Mikhail E. Muzychuk, Gottfried Tinhofer:
Recognizing Circulant Graphs in Polynomial Time: An Application of Association Schemes. - L. J. Cummings, M. Mays:
A One-Sided Zimin Construction. - Doron Zeilberger:
The Umbral Transfer-Matrix Method. IV. Counting Self-Avoiding Polygons and Walks. - Patric R. J. Östergård, William D. Weakley:
Values of Domination Numbers of the Queen's Graph. - Jenny Alvarez, Miguel Amadis, George Boros, Dagan Karp, Victor H. Moll, Leobardo Rosales:
An Extension of a Criterion for Unimodality. - Ralph Howard, Gyula Károlyi, László A. Székely:
Towards a Katona Type Proof for the 2-intersecting Erdos-Ko-Rado Theorem. - Michael E. Hoffman:
An Analogue of Covering Space Theory for Ranked Posets. - Andrzej Czygrinow, Genghua Fan, Glenn Hurlbert, Henry A. Kierstead, William T. Trotter:
Spanning Trees of Bounded Degree. - János Barát, Péter Hajnal:
The Arc-Width of a Graph. - Zdenek Dvorák, Daniel Král:
On Planar Mixed Hypergraphs. - Ömer Egecioglu, Timothy Redmond, Charles Ryavec:
From a Polynomial Riemann Hypothesis to Alternating Sign Matrices. - Ben Wieland, Anant P. Godbole:
On the Domination Number of a Random Graph. - Alexander K. Kelmans, Dhruv Mubayi, Benny Sudakov:
Asymptotically Optimal Tree-Packings in Regular Graphs. - Irène Charon, Iiro S. Honkala, Olivier Hudry, Antoine Lobstein:
General Bounds for Identifying Codes in Some Infinite Regular Graphs. - Jason Bandlow, Kendra Killpatrick:
An Area-to-Inv Bijection Between Dyck Paths and 312-avoiding Permutations. - Michael Plantholt, Shailesh K. Tipnis:
All Regular Multigraphs of Even Order and High Degree Are 1-factorable.
- Ulrich Tamm:
Some Aspects of Hankel Matrices in Coding Theory and Combinatorics.
- David Bruce Wilson:
Diagonal Sums of Boxed Plane Partitions. - Jeffrey O. Shallit, Ming-wei Wang:
Weakly Self-Avoiding Words and a Construction of Friedman. - Daniel Kobler, André Kündgen:
Gaps in the Chromatic Spectrum of Face-Constrained Plane Graphs. - Bruce E. Sagan, John S. Caughman IV:
The Multiplicities of a Dual-thin Q-polynomial Association Scheme. - D. de Caen:
A Note on the Ranks of Set-Inclusion Matrices. - Grant Cairns:
Queens on Non-square Tori. - Matthias Beck, Ira M. Gessel, Takao Komatsu:
The Polynomial Part of a Restricted Partition Function Related to the Frobenius Problem. - Alain Lascoux:
About Division by 1. - Chunhui Lai:
A Lower Bound for the Number of Edges in a Graph Containing No Two Cycles of the Same Length.
Volume 8, Number 2, 2001
Introduction
- Shaula Fraenkel:
Aviezri Fraenkel: A Brief Biography. - Richard K. Guy:
Aviezri Fraenkel and Combinatorial Games. - Jamie Simpson:
Aviezri Fraenkel's Work in Number Theory. - Yaacov Choueka:
Aviezri Fraenkel's Work in Information Retrieval and Related Areas.
- Doron Zeilberger:
How Berger, Felzenbaum and Fraenkel Revolutionized Covering - Systems the Same Way that George Boole Revolutionized Logic.
- Michael H. Albert, Richard J. Nowakowski:
The Game of End-Nim. - Arthur T. Benjamin, Matthew Fluet, Mark L. Huber:
Optimal Token Allocations in Solitaire Knock 'm Down. - Tom Bohman, Ron Holzman, Daniel J. Kleitman:
Six Lonely Runners. - Graeme L. Cohen, Elliot Tonkes:
Dartboard Arrangements. - Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzón:
Computing Evolutionary Chains in Musical Sequences. - Roger B. Eggleton:
The Well-Rounded Linear Function. - Hikoe Enomoto, Gyula O. H. Katona:
Pairs of Disjoint q-element Subsets Far from Each Other. - Péter L. Erdös, Péter Sziklai, David C. Torney:
A Finite Word Poset. - Thomas S. Ferguson:
Another Form of Matrix Nim. - Aviezri S. Fraenkel, Tamar Seeman, Jamie Simpson:
The Subword Complexity of a Two-Parameter Family of Sequences. - Joseph Kahane, Alexander J. E. Ryba:
The Hexad Game. - Henry A. Kierstead, William T. Trotter:
Competitive Colorings of Oriented Graphs. - Arnold Knopfmacher, Helmut Prodinger:
A Simple Card Guessing Game Revisited. - Jaroslav Nesetril, Éric Sopena:
On the Oriented Game Chromatic Number. - Jane Pitman:
Sumsets of Finite Beatty Sequences. - Holger Schanz, Uzy Smilansky:
Combinatorial Identities from the Spectral Theory of Quantum Graphs. - Joel H. Spencer, Katherine St. John:
The Tenacity of Zero-One Laws.
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-25 20:51 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:
