Volume 15, Number 1, 2008

• 
  Shelley L. Rasmussen: On 3-Harness Weaving: Cataloging Designs Generated by Fundamental Blocks Having Distinct Rows and Columns.
• 
  Manuel Kauers, Carsten Schneider: Automated Proofs for Some Stirling Number Identities.
• 
  Iiro S. Honkala, Tero Laihonen: On Identifying Codes in the King Grid that are Robust Against Edge Deletions.
• 
  Drago Bokal, Gasper Fijavz, David R. Wood: The Minor Crossing Number of Graphs with an Excluded Minor.
• 
  Le Anh Vinh: Explicit Ramsey Graphs and Erdös Distance Problems over Finite Euclidean and Non-Euclidean Spaces.
• 
  Ömer Egecioglu, Timothy Redmond, Charles Ryavec: Almost Product Evaluation of Hankel Determinants.
• 
  Roger E. Behrend: Osculating Paths and Oscillating Tableaux.
• 
  Ligong Wang, Cornelis Hoede: Constructing Fifteen Infinite Classes of Nonregular Bipartite Integral Graphs.
• 
  Marcelo H. de Carvalho, C. H. C. Little: Vector Spaces and the Petersen Graph.
• 
  Uwe Schauz: Algebraically Solvable Problems: Describing Polynomials as Equivalent to Explicit Solutions.
• 
  Walter Stromquist: Envy-Free Cake Divisions Cannot be Found by Finite Protocols.
• 
  Maria Axenovich, Ryan Martin: Avoiding Rainbow Induced Subgraphs in Vertex-Colorings.
• 
  Leah Wrenn Berman: Symmetric Simplicial Pseudoline Arrangements.
• 
  Caroline J. Klivans, Victor Reiner: Shifted Set Families, Degree Sequences, and Plethysm.
• 
  Joseph E. Bonin: Transversal Lattices.
• 
  Matthias Köppe, Sven Verdoolaege: Computing Parametric Rational Generating Functions with a Primal Barvinok Algorithm.
• 
  Shi-Mei Ma, Yi Wang: q-Eulerian Polynomials and Polynomials with Only Real Zeros.
• 
  Frank Bullock, Marietjie Frick, Joy Singleton, Susan A. van Aardt, Christina M. Mynhardt: Maximal Nontraceable Graphs with Toughness less than One.
• 
  Marcelo H. de Carvalho, C. H. C. Little: Ear Decompositions in Combed Graphs.
• 
  József Balogh, Ryan Martin: Edit Distance and its Computation.
• 
  Edward A. Bender, E. Rodney Canfield, L. Bruce Richmond: Coefficients of Functional Compositions Often Grow Smoothly.
• 
  Catarina P. Avelino, Altino F. Santos: Spherical F-Tilings by Triangles and r-Sided Regular Polygons, r >= 5.
• 
  Matjaz Konvalinka: An Inverse Matrix Formula in the Right-Quantum Algebra.
• 
  Michael E. Picollelli: An Anti-Ramsey Condition on Trees.
• 
  Avi Berman, Shmuel Friedland, Leslie Hogben, Uriel G. Rothblum, Bryan L. Shader: Minimum Rank of Matrices Described by a Graph or Pattern over the Rational, Real and Complex Numbers.
• 
  Dhruv Mubayi, John M. Talbot: Extremal Problems for t-Partite and t-Colorable Hypergraphs.
• 
  Jan Kyncl, Martin Tancer: The Maximum Piercing Number for some Classes of Convex Sets with the (4, 3)-property.
• 
  Pierangela Veneziani: Graph-Based Upper Bounds for the Probability of the Union of Events.
• 
  Stephen Howe: Dominating Sets of Random 2-in 2-out Directed Graphs.
• 
  Kris Coolsaet, Jan Degraer: Using Algebraic Properties of Minimal Idempotents for Exhaustive Computer Generation of Association Schemes.
• 
  Xueliang Li, Yan Liu: Nonexistence of Triples of Nonisomorphic Connected Graphs with Isomorphic Connected P₃-graphs.
• 
  Domingos Dellamonica Jr., Yoshiharu Kohayakawa, Martin Marciniszyn, Angelika Steger: On the Resilience of Long Cycles in Random Graphs.
• 
  Ermelinda DeLaViña, Bill Waller: Spanning Trees with Many Leaves and Average Distance.
• 
  Arthur T. Benjamin, Alex K. Eustis, Sean S. Plott: The 99th Fibonacci Identity.
• 
  Khodabakhsh Hessami Pilehrood, Tatiana Hessami Pilehrood: Generating Function Identities for ζ(2n+2), ζ(2n+3) via the WZ Method.
• 
  Lun Lv, Guoce Xin, Yue Zhou: Two Coefficients of the Dyson Product.
• 
  Adrian Dumitrescu, Minghui Jiang: On a Covering Problem for Equilateral Triangles.
• 
  Ron M. Adin, Jeffrey B. Remmel, Yuval Roichman: The Combinatorics of the Garsia-Haiman Modules for Hook Shapes.
• 
  Vít Jelínek, Toufik Mansour: On Pattern-Avoiding Partitions.
• 
  Artem A. Zhuravlev, Melissa S. Keranen, Donald L. Kreher: Small Group Divisible Steiner Quadruple Systems.
• 
  Jirí Matousek, Robert Sámal: Induced Trees in Triangle-Free Graphs.
• 
  T. L. Alderson, Aiden A. Bruen: Codes from Cubic Curves and their Extensions.
• 
  Chin-Lin Shiue, Hung-Lin Fu: The IC-Indices of Complete Bipartite Graphs.
• 
  Mohammad Ghebleh: Circular Chromatic Index of Generalized Blanusa Snarks.
• 
  Jason Bandlow: An Elementary Proof of the Hook Formula.
• 
  Isidoro Gitler, Petr Hlinený, Jesús Leaños, Gelasio Salazar: The Crossing Number of a Projective Graph is Quadratic in the Face-Width.
• 
  Andrzej Dudek, Vojtech Rödl: On the Turán Properties of Infinite Graphs.
• 
  Javier Barajas, Oriol Serra: The Lonely Runner with Seven Runners.
• 
  Jeremy F. Alm, Roger D. Maddux, Jacob Manske: Chromatic Graphs, Ramsey Numbers and the Flexible Atom Conjecture.
• 
  Cathleen Battiste Presutti: Determining Lower Bounds for Packing Densities of Non-layered Patterns Using Weighted Templates.
• 
  Edward A. Bender, Zhicheng Gao, L. Bruce Richmond: The Map Asymptotics Constant t_g.
• 
  Ricky X. F. Chen: A Refinement of the Formula for k-ary Trees and the Gould-Vandermonde's Convolution.
• 
  Christoph Richard, Iwan Jensen, Anthony J. Guttmann: Area Distribution and Scaling Function for Punctured Polygons.
• 
  Paul Heideman, Emilie Hogan: A New Family of Somos-like Recurrences.
• 
  Wolfgang Haas: On the Failing Cases of the Johnson Bound for Error-Correcting Codes.
• 
  Peter Adams, Darryn E. Bryant, Melinda Buchanan: Completing Partial Latin Squares with Two Filled Rows and Two Filled Columns.
• 
  Yair Caro, Arieh Lev, Yehuda Roditty, Zsolt Tuza, Raphael Yuster: On Rainbow Connection.
• 
  M. Z. Garaev: A Quantified Version of Bourgain's Sum-Product Estimate in F_p for Subsets of Incomparable Sizes.
• 
  Alan M. Frieze, Michael Krivelevich: On Rainbow Trees and Cycles.
• 
  Joanna Polcyn: Large Holes in Quasi-Random Graphs.
• 
  Robert Shwartz, Ron M. Adin, Yuval Roichman: Major Indices and Perfect Bases for Complex Reflection Groups.
• 
  Marc Fortin: The MacNeille Completion of the Poset of Partial Injective Functions.
• 
  Karl Dilcher: Determinant Expressions for q-Harmonic Congruences and Degenerate Bernoulli Numbers.
• 
  Ralf Schiffler: A Cluster Expansion Formula (A_n case).
• 
  Hilarion L. M. Faliharimalala, Jiang Zeng: Derangements and Euler's difference table for C_l wr S_n.
• 
  Leonid Gurvits: Van der Waerden/Schrijver-Valiant like Conjectures and Stable (aka Hyperbolic) Homogeneous Polynomials: One Theorem for all.
• 
  Pawel Pralat: R(3, 4)=17.
• 
  Joanne L. Hall: Graphs Associated with Codes of Covering Radius 1 and Minimum Distance 2.
• 
  Bruno Courcelle: A Multivariate Interlace Polynomial and its Computation for Graphs of Bounded Clique-Width.
• 
  Michael Krivelevich, Tibor Szabó: Biased Positional Games and Small Hypergraphs with Large Covers.
• 
  Chak-On Chow: On the Eulerian Enumeration of Involutions.
• 
  Tomasz Bartnicki, Bostjan Bresar, Jaroslaw Grytczuk, Matjaz Kovse, Zofia Miechowicz, Iztok Peterin: Game Chromatic Number of Cartesian Product Graphs.
• 
  Himmet Can: The Garnir Relations for Weyl Groups of Type C_n.
• 
  Romain Boulet, Bertrand Jouve: The Lollipop Graph is Determined by its Spectrum.
• 
  Martin Klazar: On Growth Rates of Permutations, Set Partitions, Ordered Graphs and Other Objects.
• 
  Shuhei Kamioka: A Combinatorial Derivation with Schroder Paths of a Determinant Representation of Laurent Biorthogonal Polynomials.
• 
  Stefan Felsner, Florian Zickfeld: On the Number of Planar Orientations with Prescribed Degrees.
• 
  Michael Reid: Asymptotically Optimal Box Packing Theorems.
• 
  Alice M. Dean, Joanna A. Ellis-Monaghan, Sarah Hamilton, Greta Pangborn: Unit Rectangle Visibility Graphs.
• 
  Xiang-dong Hou: Hurwitz Equivalence in Tuples of Generalized Quaternion Groups and Dihedral Groups.
• 
  Tiago Fonseca, Paul Zinn-Justin: On the Doubly Refined Enumeration of Alternating Sign Matrices and Totally Symmetric Self-Complementary Plane Partitions.
• 
  Jakub Przybylo: Irregularity Strength of Regular Graphs.
• 
  Jamie Simpson, Simon J. Puglisi: Words with Simple Burrows-Wheeler Transforms.
• 
  Victor Kreiman: Products of Factorial Schur Functions.
• 
  Brian K. Miceli, Jeffrey B. Remmel: Augmented Rook Boards and General Product Formulas.
• 
  William Y. C. Chen, Jing Qin, Christian M. Reidys: Crossings and Nestings in Tangled Diagrams.
• 
  Josep Conde, Joan Gimbert, J. Gonzalez, Josep M. Miret, R. Moreno: Nonexistence of Almost Moore Digraphs of Diameter Three.
• 
  Ivica Bosnjak, Petar Markovic: The 11-element case of Frankl's conjecture.
• 
  Alexander Raichev, Mark C. Wilson: Asymptotics of Coefficients of Multivariate Generating Functions: Improvements for Smooth Points.
• 
  Lenore J. Cowen, Robert Cowen, Arthur Steinberg: Totally Greedy Coin Sets and Greedy Obstructions.
• 
  A. M. d'Azevedo Breda, Patrícia S. Ribeiro, Altino F. Santos: Dihedral F-Tilings of the Sphere by Equilateral and Scalene Triangles - II.
• 
  Peter J. Cameron, Daniel Johannsen, Thomas Prellberg, Pascal Schweitzer: Counting Defective Parking Functions.
• 
  Qi Liu, Douglas B. West: Tree-Thickness and Caterpillar-Thickness under Girth Constraints.
• 
  John D. Dixon: Generating Random Elements in Finite Groups.
• 
  Michael Gnewuch: Construction of Minimal Bracketing Covers for Rectangles.
• 
  Hirobumi Mizuno, Iwao Sato: The Scattering Matrix of a Graph.
• 
  Michael E. Hoffman: A Character on the Quasi-Symmetric Functions coming from Multiple Zeta Values.
• 
  M. Parvathi, B. Sivakumar: R-S Correspondence for (Z₂ times Z₂) wr S_n and Klein-4 Diagram Algebras.
• 
  János Barát, David R. Wood: Notes on Nonrepetitive Graph Colouring.
• 
  Serguei Norine, Xuding Zhu: Circular Degree Choosability.
• 
  Mario Marietti, Damiano Testa: A Uniform Approach to Complexes arising from Forests.
• 
  Petr Hlinený: New Infinite Families of Almost-Planar Crossing-Critical Graphs.
• 
  Stefan Grünewald, Peter J. Humphries, Charles Semple: Quartet Compatibility and the Quartet Graph.
• 
  Sujith Vijay: On the Discrepancy of Quasi-Progressions.
• 
  Glenn Tesler: Distribution of Segment Lengths in Genome Rearrangements.
• 
  Diana Piguet, Maya Jakobine Stein: The Loebl-Komlós-Sós Conjecture for Trees of Diameter 5 and for Certain Caterpillars.
• 
  Paz Carmi, Vida Dujmovic, Pat Morin, David R. Wood: Distinct Distances in Graph Drawings.
• 
  Evangelos Georgiadis, David Callan, Qing-Hu Hou: Circular Digraph Walks, k-Balanced Strings, Lattice Paths and Chebychev Polynomials.
• 
  Olivier Bernardi: Tutte Polynomial, Subgraphs, Orientations and Sandpile Model: New Connections via Embeddings.
• 
  Shmuel Friedland, E. Krop, Klas Markström: On the Number of Matchings in Regular Graphs.
• 
  Daniel M. Kane, Steven Sivek: On the S_n-Modules Generated by Partitions of a Given Shape.
• 
  Chirashree Bhattacharya, Ken W. Smith: Factoring (16, 6, 2) Hadamard Difference Sets.
• 
  Xun-Tuan Su, Yi Wang: On Unimodality Problems in Pascal's Triangle.
• 
  Stefanie Gerke, Omer Giménez, Marc Noy, Andreas Weißl: The Number of Graphs Not Containing K_{3, 3} as a Minor.
• 
  Kevin Purbhoo: Compression of Root Systems and the E-Sequence.
• 
  Weidong Gao, Yuanlin Li, Jiangtao Peng, Fang Sun: Subsums of a Zero-sum Free Subset of an Abelian Group.
• 
  Weidong Gao, Yuanlin Li, Jiangtao Peng, Fang Sun: On Subsequence Sums of a Zero-sum Free Sequence II.
• 
  Guantao Chen, Ralph J. Faudree, Ronald J. Gould: Saturation Numbers of Books.
• 
  Türker Bíyíkoglu, Josef Leydold: Graphs with Given Degree Sequence and Maximal Spectral Radius.
• 
  Steve Kirkland: Laplacian Integral Graphs with Maximum Degree 3.
• 
  Alan M. Frieze, Dhruv Mubayi: On the Chromatic Number of Simple Triangle-Free Triple Systems.
• 
  Attila Bernáth, Henning Bruhn: Degree Constrained Orientations in Countable Graphs.
• 
  Odile Favaron: Global Alliances and Independent Domination in Some Classes of Graphs.
• 
  Craig Timmons: Star Coloring High Girth Planar Graphs.
• 
  John B. Polhill: Generalizations of Partial Difference Sets from Cyclotomy to Nonelementary Abelian p-Groups.
• 
  András Gyárfás, Gábor N. Sárközy, Endre Szemerédi: The Ramsey Number of Diamond-Matchings and Loose Cycles in Hypergraphs.
• 
  Domingos Dellamonica Jr., Yoshiharu Kohayakawa: An Algorithmic Friedman-Pippenger Theorem on Tree Embeddings and Applications.
• 
  Mary Flahive: Balancing Cyclic R-ary Gray Codes II.
• 
  Edwin R. van Dam: The Spectral Excess Theorem for Distance-Regular Graphs: A Global (Over)view.
• 
  Chris Berg, Monica Vazirani: (l, 0)-Carter Partitions, their Crystal-Theoretic Behavior and Generating Function.
• 
  Xueliang Li, Fengxia Liu: Partitioning 3-Edge-Colored Complete Equi-Bipartite Graphs by Monochromatic Trees under a Color Degree Condition.
• 
  Denis Chebikin: Variations on Descents and Inversions in Permutations.
• 
  Guo-Niu Han: Discovering Hook Length Formulas by an Expansion Technique.
• 
  Daan Krammer: Generalisations of the Tits Representation.
• 
  Marcos A. Kiwi, Martin Loebl: Towards the Distribution of the Size of a Largest Planar Matching and Largest Planar Subgraph in Random Bipartite Graphs.
• 
  Ron Aharoni, Eli Berger, Agelos Georgakopoulos, Philipp Sprüssel: Strongly Maximal Matchings in Infinite Graphs.
• 
  Andrew Frohmader: More Constructions for Turan's (3, 4)-Conjecture.
• 
  Guanghui Wang, Hao Li: Heterochromatic Matchings in Edge-Colored Graphs.
• 
  Harm Derksen, Theodore Owen: New Graphs of Finite Mutation Type.
• 
  Torsten Sander: On Certain Eigenspaces of Cographs.
• 
  Dibyendu De, Ram Krishna Paul: Universally Image Partition Regularity.
• 
  Matthew Fayers: Regularisation and the Mullineux Map.
• 
  Stefaan De Winter, Felix Lazebnik, Jacques Verstraëte: An Extremal Characterization of Projective Planes.
• 
  Amitava Bhattacharya, Shmuel Friedland, Uri N. Peled: On the First Eigenvalue of Bipartite Graphs.
• 
  Uwe Schauz: On the Dispersions of the Polynomial Maps over Finite Fields.
• 
  Drew Armstrong, Sen-Peng Eu: Nonhomogeneous Parking Functions and Noncrossing Partitions.
• 
  A. M. d'Azevedo Breda, Patrícia S. Ribeiro, Altino F. Santos: Dihedral f-Tilings of the Sphere by Equilateral and Scalene Triangles - III.
• 
  Guillaume Chapuy, Éric Fusy, Mihyun Kang, Bilyana Shoilekova: A Complete Grammar for Decomposing a Family of Graphs into 3-Connected Components.
• 
  Sho Matsumoto: Jack Deformations of Plancherel Measures and Traceless Gaussian Random Matrices.
• 
  Marietjie Frick, Susan A. van Aardt, Jean E. Dunbar, Morten Hegner Nielsen, Ortrud R. Oellermann: A Traceability Conjecture for Oriented Graphs.
• 
  Alex Iosevich, Steven Senger: Orthogonal Systems in Vector Spaces over Finite Fields.
• 
  Ronald Brown, Ifor Morris, J. Shrimpton, Christopher D. Wensley: Graphs of Morphisms of Graphs.
• 
  Andries E. Brouwer: Small Integral Trees.
• 
  Amin Coja-Oghlan, Alan M. Frieze: Random k-SAT: The Limiting Probability for Satisfiability for Moderately Growing k.
• 
  Ralucca Gera, Jian Shen: Extension of Strongly Regular Graphs.
• 
  Sylvain Gravier, Julien Moncel, Ahmed Semri: Identifying Codes of Cartesian Product of Two Cliques of the Same Size.
• 
  Oliver T. Dasbach: A Natural Series for the Natural Logarithm.
• 
  Vladimir Nikiforov: Graphs with Many Copies of a Given Subgraph.
• 
  Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton, Andreas Spillner: Characterizing Cell-Decomposable Metrics.
• 
  Friedrich Eisenbrand, János Pach, Thomas Rothvoß, Nir B. Sopher: Convexly Independent Subsets of the Minkowski Sum of Planar Point Sets.
• 
  Peter Borg: Intersecting and Cross-Intersecting Families of Labeled Sets.
• 
  Andreas N. Lagerås, Mathias Lindholm: A Note on the Component Structure in Random Intersection Graphs with Tunable Clustering.
• 
  Christian Haase, Benjamin Nill, Andreas Paffenholz, Francisco Santos: Lattice Points in Minkowski Sums.
• 
  Kathy Qing Ji: A Combinatorial Proof of Andrews' Smallest Parts Partition Function.
• 
  Noga Alon, Shmuel Friedland: The Maximum Number of Perfect Matchings in Graphs with a Given Degree Sequence.
• 
  V. Anuradha, Chinmay Jain, Jack Snoeyink, Tibor Szabó: How Long Can a Graph be Kept Planar?
• 
  M. Farrokhi D. G.: An Identity Generator: Basic Commutators.
• 
  Gábor Simonyi: Necklace Bisection with One Cut Less than Needed.
• 
  David Auger: Induced Paths in Twin-Free Graphs.
• 
  Matthew H. J. Fiset, Alexander M. Kasprzyk: A Note on Palindromic delta-Vectors for Certain Rational Polytopes.
• 
  Yuqin Zhang, Ren Ding: A Note about Bezdek's Conjecture on Covering an Annulus by Strips.
• 
  Sherry H. F. Yan: Bijective Proofs of Identities from Colored Binary Trees.
• 
  Miklós Bóna: Generalized Descents and Normality.
• 
  Hamed Shirazi, Jacques Verstraëte: A Note on Polynomials and f-Factors of Graphs.
• 
  Vincent Vatter: A Sharp Bound for the Reconstruction of Partitions.
• 
  Jujuan Zhuang: Unextendible Sequences in Finite Abelian Groups.
• 
  Alexandr V. Kostochka, Michael Stiebitz: Partitions and Edge Colourings of Multigraphs.
• 
  Ailian Chen, Fuji Zhang, Hao Li: Rainbow H-Factors of Complete s-Uniform r-Partite Hypergraphs.
• 
  Jaume Martí-Farré, Carles Padró, Leonor Vázquez: On the Diameter of Matroid Ports.
• 
  C. Merino: The Number of 0-1-2 Increasing Trees as Two Different Evaluations of the Tutte Polynomial of a Complete Graph.
• 
  Yaming Yu: Evaluation of a Multiple Integral of Tefera via Properties of the Exponential Distribution.
• 
  Christian Gutschwager: On Base Partitions and Cover Partitions of Skew Characters.
• 
  Russell May: Coupon Collecting with Quotas.
• 
  Le Anh Vinh: On the Number of Orthogonal Systems in Vector Spaces over Finite Fields.
• 
  Masaaki Harada: An Extremal Doubly Even Self-Dual Code of Length 112.
• 
  James D. Currie, Narad Rampersad: For each α > 2 there is an Infinite Binary Word with Critical Exponent α.
• 
  Jakub Przybylo: A Note on Neighbour-Distinguishing Regular Graphs Total-Weighting.
• 
  Terry A. McKee: Uniquely Hamiltonian Characterizations of Distance-Hereditary and Parity Graphs.
• 
  Angela Aguglia, Luca Giuzzi: On the Non-Existence of Certain Hyperovals in Dual Andre Planes of Order 2^2h.
• 
  B. Y. Stodolsky: On Domination in 2-Connected Cubic Graphs.
• 
  Andrew Suk: A Note on K_{k, k}-Cross Free Families.
• 
  Chun-Yen Shen: Quantitative Sum Product Estimates on Different Sets.
• 
  Tero Harju, Dirk Nowotka: Bordered Conjugates of Words over Large Alphabets.
• 
  Klay Kruczek, Eric Sundberg: A Pairing Strategy for Tic-Tac-Toe on the Integer Lattice with Numerous Directions.
• 
  Song Guo: A Counterexample to a Conjecture of Erdös, Graham and Spencer.

last updated on Sat May 25 05:56:59 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page