Volume 13, Number 1, 2006

• 
  Michael Hardy: Combinatorics of Partial Derivatives.
• 
  Simon Bliudze, Daniel Krob: A Combinatorial Approach to Evaluation of Reliability of the Receiver Output for BPSK Modulation with Spatial Diversity.
• 
  János Barát, Jirí Matousek, David R. Wood: Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness.
• 
  Sarah Iveson: Inversions Within Restricted Fillings of Young Tableaux.
• 
  Ales Prívetivý: Discrepancy of Sums of Three Arithmetic Progressions.
• 
  Winston C. Yang: Adding Layers to Bumped-Body Polyforms with Minimum Perimeter Preserves Minimum Perimeter.
• 
  Yaming Yu: More Forbidden Minors for Wye-Delta-Wye Reducibility.
• 
  Markus Kuba, Alois Panholzer: Descendants in Increasing Trees.
• 
  David L. Neel, Michael E. Orrison: The Linear Complexity of a Graph.
• 
  Kejun Chen, Ruizhong Wei: A Few More Cyclic Steiner 2-Designs.
• 
  Christine T. Cheng: On Computing the Distinguishing Numbers of Trees and Forests.
• 
  David Bevan: Sets of Points Determining Only Acute Angles and Some Related Colouring Problems.
• 
  Raphael Yuster: Rainbow H-factors.
• 
  Nikolay Rangelov Kolev, Nedyalko Dimov Nenov: New Upper Bound for a Class of Vertex Folkman Numbers.
• 
  Srecko Brlek, Andrea Frosini, Simone Rinaldi, Laurent Vuillon: Tilings by Translation: Enumeration by a Rational Language Approach.
• 
  Karen L. Collins, Ann N. Trenk: The Distinguishing Chromatic Number.
• 
  Marcelo Aguiar, Walter Moreira: Combinatorics of the Free Baxter Algebra.
• 
  Andrius Kulikauskas, Jeffrey B. Remmel: Lyndon Words and Transition Matrices between Elementary, Homogeneous and Monomial Symmetric Functions.
• 
  Noga Alon, Benny Sudakov: H-Free Graphs of Large Minimum Degree.
• 
  Pawel Zylinski: Orthogonal Art Galleries with Holes: A Coloring Proof of Aggarwal's Theorem.
• 
  Sarang Aravamuthan, Sachin Lodha: Covering Codes for Hats-on-a-line.
• 
  Joshua N. Cooper: A Permutation Regularity Lemma.
• 
  Éric Fusy: Counting d-Polytopes with d+3 Vertices.
• 
  Steven Sivek: Some Plethysm Results related to Foulkes' Conjecture.
• 
  Harold Widom: On the Limiting Distribution for the Length of the Longest Alternating Sequence in a Random Permutation.
• 
  Bradley W. Jackson, Frank Ruskey: Meta-Fibonacci Sequences, Binary Trees and Extremal Compact Codes.
• 
  Leah Wrenn Berman: Some Results on Odd Astral Configurations.
• 
  David J. Grynkiewicz, Rasheed Sabar: Monochromatic and Zero-Sum Sets of Nondecreasing Modified Diameter.
• 
  Ronald J. Gould, Tomasz Luczak, John R. Schmitt: Constructive Upper Bounds for Cycle-Saturated Graphs of Minimum Size.
• 
  Elise Janvresse, Thierry de la Rue, Yvan Velenik: A Note on Domino Shuffling.
• 
  Mark Lipson: Completion of the Wilf-Classification of 3-5 Pairs Using Generating Trees.
• 
  Kris Coolsaet, Jan Degraer, Edward Spence: The Strongly Regular (45, 12, 3, 3) Graphs.
• 
  Anisse Kasraoui, Jiang Zeng: Distribution of Crossings, Nestings and Alignments of Two Edges in Matchings and Partitions.
• 
  David Emms, Edwin R. Hancock, Simone Severini, Richard C. Wilson: A Matrix Representation of Graphs and its Spectrum as a Graph Invariant.
• 
  Daniel Felix: Optimal Penney Ante Strategy via Correlation Polynomial Identities.
• 
  Maria Axenovich: On Subgraphs Induced by Transversals in Vertex-Partitions of Graphs.
• 
  Christopher R. H. Hanusa: A Gessel-Viennot-Type Method for Cycle Systems in a Directed Graph.
• 
  François Bergeron, Riccardo Biagioli: Tensorial Square of the Hyperoctahedral Group Coinvariant Space.
• 
  John S. Caughman IV, J. J. P. Veerman: Kernels of Directed Graph Laplacians.
• 
  Benjamin Doerr, Michael Gnewuch, Nils Hebbinghaus: Discrepancy of Symmetric Products of Hypergraphs.
• 
  Dillon Mayhew: Equitable Matroids.
• 
  Mark A. Shattuck, Carl G. Wagner: A New Statistic on Linear and Circular r-Mino Arrangements.
• 
  Christopher Jones, Angela Matney, Harold N. Ward: Optimal Four-Dimensional Codes over GF(8).
• 
  Peter Keevash, Po-Shen Loh, Benny Sudakov: Bounding the Number of Edges in Permutation Graphs.
• 
  Naiomi Cameron, Kendra Killpatrick: Domino Fibonacci Tableaux.
• 
  Amitava Bhattacharya, S. Sivasubramanian, Murali K. Srinivasan: The Polytope of Degree Partitions.
• 
  Jonathan Cutler, Lars-Daniel Ohman: Latin Squares with Forbidden Entries.
• 
  Robert J. MacG. Dawson, Blair Doyle: Tilings of the Sphere with Right Triangles I: The Asymptotically Right Families.
• 
  Robert J. MacG. Dawson, Blair Doyle: Tilings of the Sphere with Right Triangles II: The (1, 3, 2), (0, 2, n) Subfamily.
• 
  Peter J. Cameron, G. R. Omidi, Behruz Tayfeh-Rezaie: 3-Designs from PGL(2, q).
• 
  Ghassan Firro, Toufik Mansour: Three-Letter-Pattern-Avoiding Permutations and Functional Equations.
• 
  X. Ma: Two Finite Forms of Watson's Quintuple Product Identity and Matrix Inversion.
• 
  Ira M. Gessel, Guoce Xin: The Generating Function of Ternary Trees and Continued Fractions.
• 
  Sophie Huczynska, Vincent Vatter: Grid Classes and the Fibonacci Dichotomy for Restricted Permutations.
• 
  Tomasz Dzido, Marek Kubale, Konrad Piwakowski: On Some Ramsey and Turan-Type Numbers for Paths and Cycles.
• 
  Werner Krauth, Martin Loebl: Jamming and Geometric Representations of Graphs.
• 
  Aaron N. Siegel: Reduced Canonical Forms of Stoppers.
• 
  Jack Huizenga: The minimum size of complete caps in (Z/nZ)².
• 
  Michael A. Henning, Anders Yeo: Total Domination and Matching Numbers in Claw-Free Graphs.
• 
  Ahmed Ainouche: Relaxations of Ore's Condition on Cycles.
• 
  Uwe Schauz: Colorings and Orientations of Matrices and Graphs.
• 
  Piotr Sniady: Generalized Cauchy identities, trees and multidimensional Brownian motions. Part I: bijective proof of generalized Cauchy identities.
• 
  Jason P. Bell, Stanley Burris, Karen A. Yeats: Counting Rooted Trees: The Universal Law t(n)~C ρ^-n n^-3/2.
• 
  Sergey Kitaev, Jeffrey B. Remmel: Classifying Descents According to Equivalence mod k.
• 
  Ariane M. Masuda, Daniel Panario, Qiang Wang: The Number of Permutation Binomials over F_4p+1 where p and 4p+1 are Primes.
• 
  Mariana Raykova: Permutation Reconstruction from Minors.
• 
  Jakob Jonsson: Hard Squares with Negative Activity and Rhombus Tilings of the Plane.
• 
  Murray Elder: Permutations Generated by a Stack of Depth 2 and an Infinite Stack in Series.
• 
  Alexandre Pinlou: On Oriented Arc-Coloring of Subcubic Graphs.
• 
  Melody Chan: The Maximum Distinguishing Number of a Group.
• 
  Peter McNamara: Factorial Grothendieck Polynomials.
• 
  David J. Galvin: Bounding the Partition Function of Spin-Systems.
• 
  David R. Wood: Drawing a Graph in a Hypercube.
• 
  Valerie L. Watts: Fractional Biclique Covers and Partitions of Graphs.
• 
  Nantel Bergeron, Christophe Hohlweg, Mercedes Rosas, Mike Zabrocki: Grothendieck Bialgebras, Partition Lattices, and Symmetric Functions in Noncommutative Variables.
• 
  Bart De Bruyn, Pieter Vandecasteele: The Valuations of the Near Octagon I₄.
• 
  Catherine S. Greenhill, Andrzej Rucinski: Neighbour-Distinguishing Edge Colourings of Random Regular Graphs.
• 
  Debra L. Boutin: Identifying Graph Automorphisms Using Determining Sets.
• 
  David Eppstein: Cubic Partial Cubes from Simplicial Arrangements.
• 
  Brian Hopkins, Michael A. Jones: Shift-Induced Dynamical Systems on Partitions and Compositions.
• 
  Julie Cain, Nicholas C. Wormald: Encores on Cores.
• 
  James D. Currie, Narad Rampersad, Jeffrey Shallit: Binary Words Containing Infinitely Many Overlaps.
• 
  Magnus Bordewich, Charles Semple, Mike A. Steel: Identifying X-Trees with Few Characters.
• 
  Christopher K. Storm: The Zeta Function of a Hypergraph.
• 
  Peter J. Cameron, Thomas Prellberg, Dudley Stark: Asymptotics for Incidence Matrix Classes.
• 
  Marc A. A. van Leeuwen: Double Crystals of Binary and Integral Matrices.
• 
  Anthony Henderson: Plethysm for Wreath Products and Homology of Sub-Posets of Dowling Lattices.
• 
  Anka Golemac, Josko Mandic, Tanja Vucicic: New Regular Partial Difference Sets and Strongly Regular Graphs with Parameters (96, 20, 4, 4) and (96, 19, 2, 4).
• 
  Vít Jelínek, Nelson Y. Li, Toufik Mansour, Sherry H. F. Yan: Matchings Avoiding Partial Patterns and Lattice Paths.
• 
  Guantao Chen, Joan P. Hutchinson, Ken Keating, Jian Shen: Characterization of [1, k]-Bar Visibility Trees.
• 
  Iwao Sato: Weighted Zeta Functions of Graph Coverings.
• 
  Nicholas J. Cavenagh, Diana Combe, Adrian M. Nelson: Edge-Magic Group Labellings of Countable Graphs.
• 
  Laura Ciobanu, Sasa Radomirovic: Restricted Walks in Regular Trees.
• 
  Nick Gill: Nilpotent Singer Groups.
• 
  Richard A. Brualdi, Martin Loebl, Ondrej Pangrác: Perfect Matching Preservers.
• 
  C. Little, A. Vince: Parity Versions of 2-Connectedness.
• 
  Douglas R. Woodall: Total 4-Choosability of Series-Parallel Graphs.
• 
  Timothy J. Hetherington, Douglas R. Woodall: Edge and Total Choosability of Near-Outerplanar Graphs.
• 
  Terence Tao: A Quantitative Ergodic Theory Proof of Szemerédi's Theorem.
• 
  Manuel Kauers: Shift Equivalence of P-finite Sequences.
• 
  Maurice Pouzet, Norbert Sauer: From Well-Quasi-Ordered Sets to Better-Quasi-Ordered Sets.
• 
  Miklós Bóna: On a Balanced Property of Derangements.
• 
  Philippe Flajolet, Éric Fusy, Xavier Gourdon, Daniel Panario, Nicolas Pouyanne: A Hybrid of Darboux's Method and Singularity Analysis in Combinatorial Asymptotics.
• 
  Leah Wrenn Berman: Movable (n₄) Configurations.
• 
  Boris Alexeev: On Lengths of Rainbow Cycles.
• 
  Bernhard Gittenberger, Johannes Mandlburger: Hayman Admissible Functions in Several Variables.
• 
  Andrew Granville: Cycle Lengths in a Permutation are Typically Poisson.
• 
  Richard Brak, Sylvie Corteel, John W. Essam, Robert Parviainen, Andrew Rechnitzer: A Combinatorial Derivation of the PASEP Stationary State.
• 
  L. Wyatt Alverson II, Robert G. Donnelly, Scott J. Lewis, Robert Pervine: Constructions of Representations of Rank Two Semisimple Lie Algebras with Distributive Lattices.
• 
  Paul Zinn-Justin: Proof of the Razumov-Stroganov Conjecture for some Infinite Families of Link Patterns.
• 
  Robert Parviainen: Permutations, Cycles and the Pattern 2-13.
• 
  William Y. C. Chen, Toufik Mansour, Sherry H. F. Yan: Matchings Avoiding Partial Patterns.

• 
  Jörn Quistorff: A Survey on Packing and Covering Problems in the Hamming Permutation Space.
• 
  Derek H. Smith, L. A. Hughes, Stephanie Perkins: A New Table of Constant Weight Codes of Length Greater than 28.

• 
  János Pach, Dömötör Pálvölgyi: Bounded-Degree Graphs can have Arbitrarily Large Slope Numbers.
• 
  Nathan Linial, Michael E. Saks, David Statter: The Non-Crossing Graph.
• 
  Arthur H. Busch: A Note on the Number of Hamiltonian Paths in Strong Tournaments.
• 
  Fan R. K. Chung: The Diameter and Laplacian Eigenvalues of Directed Graphs.
• 
  Catalin Zara: Chains, Subwords, and Fillings: Strong Equivalence of Three Definitions of the Bruhat Order.
• 
  Irit Dinur, Ehud Friedgut: Proof of an Intersection Theorem via Graph Homomorphisms.
• 
  Arthur Holshouser, Harold Reiter: Dynamic Single-Pile Nim Using Multiple Bases.
• 
  Daniel Goldstein, Richard Stong: On the Number of Possible Row and Column Sums of 0, 1-Matrices.
• 
  Hui-Qin Cao: An Addition Theorem on the Cyclic Group Z_{p^α q^β}.
• 
  Boris Bukh: A Point in Many Triangles.
• 
  Rebecca Smith: Permutation Reconstruction.
• 
  William Y. C. Chen, Sherry H. F. Yan: Noncrossing Trees and Noncrossing Graphs.
• 
  T. R. Riley, William P. Thurston: The Absence of Efficient Dual Pairs of Spanning Trees in Planar Graphs.
• 
  Stephan G. Wagner: On an Identity for the Cycle Indices of Rooted Tree Automorphism Groups.
• 
  Benjamin Braun: An Ehrhart Series Formula For Reflexive Polytopes.
• 
  Edward Dobson: On the Proof of a Theorem of Pálfy.
• 
  Craig A. Sloss: The Induced Subgraph Order on Unlabelled Graphs.
• 
  William Y. C. Chen, Kathy Q. Ji, Herbert S. Wilf: BG-Ranks and 2-Cores.
• 
  Caihuan Zhang: Parameter Augmentation for Two Formulas.
• 
  Mohammad Ghebleh, Daniel Král, Serguei Norine, Robin Thomas: The Circular Chromatic Index of Flower Snarks.
• 
  Anna de Mier: On the Symmetry of the Distribution of k-Crossings and k-Nestings in Graphs.
• 
  Sankaran Viswanath: A Note on Exponents vs Root Heights for Complex Simple Lie Algebras.

last updated on Fri May 24 05:50:09 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page