Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Electronic Journal of Combinatorics, Volume 12
Volume 12, 2005
- Jeffrey H. Dinitz, Peter Dukes
, Douglas R. Stinson:
Sequentially Perfect and Uniform One-Factorizations of the Complete Graph. - Petteri Kaski, Patric R. J. Östergård:
One-Factorizations of Regular Graphs of Order 12. - Jakob Jonsson:
Optimal Decision Trees on Simplicial Complexes. - Tom Roby, Itaru Terada:
A Two-Dimensional Pictorial Presentation of Berele's Insertion Algorithm for Symplectic Tableaux. - Paulo Bárcia, J. Orestes Cerdeira:
k-Colour Partitions of Acyclic Tournaments. - Philippe Di Francesco, Paul Zinn-Justin:
Around the Razumov-Stroganov Conjecture: Proof of a Multi-Parameter Sum Rule. - Theresia Eisenkölbl:
(-1)-Enumeration of Self-Complementary Plane Partitions. - Marek Janata, Martin Loebl, Jácint Szabó:
The Edmonds-Gallai Decomposition for the k-Piece Packing Problem. - Nicholas A. Loehr:
Conjectured Statistics for the Higher q, t-Catalan Sequences. - Marc A. A. van Leeuwen:
Spin-Preserving Knuth Correspondences for Ribbon Tableaux. - Martin Klazar:
Counting Set Systems by Weight. - J.-F. Fortin, Patrick Jacob, P. Mathieu:
Generating Function for K-Restricted Jagged Partitions. - Sylvain Gravier, Julien Moncel:
Construction of Codes Identifying Sets of Vertices. - Aaron D. Jaggard:
Subsequence Containment by Involutions. - Humberto Luiz Talpo, Marcelo Firer:
Trees and Reflection Groups. - Aristidis Sapounakis, Panagiotis Tsikouras:
Counting peaks and valleys in k-colored Motzkin paths. - Dwight Duffus, Bill Sands:
Splitting Numbers of Grids. - Sen-Peng Eu, Tung-Shan Fu:
A Simple Proof of the Aztec Diamond Theorem. - Andreas Baltz, Peter Hegarty, Jonas Knape, Urban Larsson, Tomasz Schoen:
The Structure of Maximum Subsets of {1, ..., n} with No Solutions to a+b = kc. - Mieczyslaw Borowiecki, Ingo Schiermeyer, Elzbieta Sidorowicz:
Ramsey (K1,2,K3)-Minimal Graphs. - Anna Melnikov:
The Combinatorics of Orbital Varieties Closures of Nilpotent Order 2 in sln. - Ian M. Wanless:
Atomic Latin Squares based on Cyclotomic Orthomorphisms. - Andreas Blass, Gábor Braun:
Random Orders and Gambler's Ruin. - Balázs Patkós:
How Different Can Two Intersecting Families Be? - Ian Le:
Wilf Classes of Pairs of Permutations of Length 4. - James Grime:
The Hook Fusion Procedure. - Dale Beihoffer, Jemimah Hendry, Albert Nijenhuis, Stan Wagon:
Faster Algorithms for Frobenius Numbers. - Cristina M. Ballantine, Rosa C. Orellana:
On the Kronecker Product s(n-p,p) * sλ. - E. Rodney Canfield, Brendan D. McKay:
Asymptotic Enumeration of Dense 0-1 Matrices with Equal Row Sums and Equal Column Sums. - Ira M. Gessel, Pallavi Jayawant:
A Triple Lacunary Generating Function for Hermite Polynomials. - Michael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Chris C. Handley, Derek A. Holton, D. J. McCaughan, Hans P. van Ditmarsch:
Sorting Classes. - Marietjie Frick, Joy Singleton:
Lower Bound for the Size of Maximal Nontraceable Graphs. - He Chen, Xueliang Li:
Long Heterochromatic Paths in Edge-Colored Graphs. - Kevin M. Woods:
Computing the Period of an Ehrhart Quasi-Polynomial. - Kristina C. Garrett:
A Determinant Identity that Implies Rogers-Ramanujan. - John P. Steinberger:
Indecomposable Tilings of the Integers with Exponentially Long Periods. - Hiroshi Nagamochi:
Packing Unit Squares in a Rectangle. - Amy M. Fu, Alain Lascoux:
q-Identities Related to Overpartitions and Divisor Functions. - Anders Claesson:
Counting Segmented Permutations Using Bicoloured Dyck Paths. - Karen Meagher, Lucia Moura:
Erdos-Ko-Rado theorems for uniform set-partition systems. - R. H. Jeurissen:
Sets in the Plane with Many Concyclic Subsets. - A. D. Forbes, Mike J. Grannell, Terry S. Griggs:
Steiner Triple Systems and Existentially Closed Graphs. - Johan Wästlund:
A Solution of Two-Person Single-Suit Whist. - Johan Wästlund:
Two-Person Symmetric Whist. - Kendra Killpatrick:
A Relationship between the Major Index for Tableaux and the Charge Statistic for Permutations. - Itai Benjamini, Christopher Hoffman:
ω-Periodic Graphs. - Michael H. Albert, Steve Linton, Nikola Ruskuc:
The Insertion Encoding of Permutations. - Marietjie Frick, Ingo Schiermeyer:
An Asymptotic Result for the Path Partition Conjecture. - Teresa Sousa:
Decompositions of Graphs into 5-Cycles and Other Small Graphs. - Avraham Goldstein, Petr Kolman, Jie Zheng:
Minimum Common String Partition Problem: Hardness and Approximations. - Noga Alon, Michael Krivelevich, Joel Spencer, Tibor Szabó:
Discrepancy Games. - Elena D. Fuchs:
Longest Induced Cycles in Circulant Graphs. - Chunwei Song:
The Generalized Schröder Theory. - Michael Gnewuch:
Bounds for the Average Lp-Extreme and the L∞-Extreme Discrepancy. - Yuqin Zhang, Yonghui Fan:
Packing and Covering a Unit Equilateral Triangle with Equilateral Triangles. - John D. Dixon:
Asymptotics of Generating the Symmetric and Alternating Groups. - Edward A. Bender, E. Rodney Canfield:
Locally Restricted Compositions I. Restricted Adjacent Differences. - M. A. Ollis:
Some Cyclic Solutions to the Three Table Oberwolfach Problem. - Eugene M. Luks, Amitabha Roy:
Combinatorics of Singly-Repairable Families. - Mike D. Atkinson, Maximillian M. Murphy, Nikola Ruskuc:
Pattern Avoidance Classes and Subpermutations. - T. Kyle Petersen:
A Note on Three Types of Quasisymmetric Functions. - Kent E. Morrison:
An Introduction to q-Species. - Bhalchandra D. Thatte:
Kocay's Lemma, Whitney's Theorem, and some Polynomial Invariant Reconstruction Problems. - Sven Hartmann, Charles H. C. Little:
Even Bonds of Prescribed Directed Parity. - Paul Dorbec, Michel Mollard:
Perfect Codes in Cartesian Products of 2-Paths and Infinite Paths. - Geoffrey McKenna:
Sunflowers in Lattices. - Geoffrey McKenna:
Isomorphism Classes of Maximal Intersecting Uniform Families Are Few. - Adam Wolfe:
5-sparse Steiner Triple Systems of Order n Exist for Almost All Admissible n. - Oleg Pikhurko, Anusch Taraz:
Degree Sequences of F-Free Graphs. - D. Dale Olesky, Bryan L. Shader, Pauline van den Driessche:
Permanents of Hessenberg (0, 1)-matrices.
- Gus Wiseman:
A Partition of Connected Graphs. - Victor J. W. Guo, Jiang Zeng:
A Combinatorial Proof of a Symmetric q-Pfaff-Saalschütz Identity. - Zhizheng Zhang:
A Note on an Identity of Andrews. - Anders Björner, Jonathan David Farley:
Chain Polynomials of Distributive Lattices are 75% Unimodal. - Thomas Lam, Jacques Verstraëte:
A Note on Graphs Without Short Even Cycles. - Tim L. Alderson:
Extending Arcs: An Elementary Proof. - Yu. Yakubovich:
Integer Partitions with Fixed Subsums. - David G. Wagner:
Rank-Three Matroids are Rayleigh. - Masao Ishikawa, Hiroyuki Kawamuko, Soichi Okada:
A Pfaffian-Hafnian Analogue of Borchardt's Identity. - Mark A. Shattuck, Carl G. Wagner:
Parity Theorems for Statistics on Domino Arrangements. - Peter Keevash:
The Turán Problem for Hypergraphs of Fixed Size. - Bostjan Bresar:
Vizing-like Conjecture for the Upper Domination of Cartesian Products of Graphs - The Proof. - Tomasz Dzido, Andrzej Nowik, Piotr Szuca:
New Lower Bound for Multicolor Ramsey Numbers for Even Cycles. - Alexander Engström:
A Note on Two Multicolor Ramsey Numbers. - Bojan Mohar:
Triangulations and the Hajós Conjecture. - Frédéric Chapoton:
Une Base Symétrique de l'Algèbre des Coinvariants Quasi-Symétriques. - Michael O. Albertson:
Distinguishing Cartesian Powers of Graphs. - John M. Talbot:
The Intersection Structure of t-Intersecting Families. - I Nengah Suparta:
A Simple Proof for the Existence of Exponentially Balanced Gray Codes. - Karen Meagher, Lucia Moura, Brett Stevens:
A Sperner-Type Theorem for Set-Partition Systems. - Béla Bollobás, Vladimir Nikiforov:
The Sum of Degrees in Cliques. - Jonas Sjöstrand:
The Cover Pebbling Theorem. - Mikio Kano, Qinglin Yu:
Pan-Factorial Property in Regular Graphs.
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:
