Parcourir par

  • Collections
  • Sources

Geodesic


    Parcourir par

    • Collections
    • Sources
The electronic journal of combinatorics
Tome 12 (2005)
Précédent Suivant


Sequentially perfect and uniform one-factorizations of the complete graph
Jeffrey H. Dinitz ; Peter Dukes ; Douglas R. Stinson

One-factorizations of regular graphs of order 12
Petteri Kaski ; Patric R. J. Östergård

Optimal decision trees on simplicial complexes
Jakob Jonsson

A two-dimensional pictorial presentation of Berele's insertion algorithm for symplectic tableaux
Tom Roby ; Itaru Terada

\(k\)-colour partitions of acyclic tournaments
Paulo Barcia ; J. Orestes Cerdeira

Around the Razumov-Stroganov conjecture: proof of a multi-parameter sum rule
P. Di Francesco ; P. Zinn-Justin

\((-1)\)-enumeration of self-complementary plane partitions
Theresia Eisenkölbl

The Edmonds-Gallai decomposition for the \(k\)-piece packing problem
Marek Janata ; Martin Loebl ; Jácint Szabó

Conjectured statistics for the higher \(q,t\)-Catalan sequences
Nicholas A. Loehr

Spin-preserving Knuth correspondences for ribbon tableaux
Marc A. A. van Leeuwen

Counting set systems by weight
Martin Klazar

Generating function for \(K\)-restricted jagged partitions
J.-F. Fortin ; P. Jacob ; P. Mathieu

Construction of codes identifying sets of vertices
Sylvain Gravier ; Julien Moncel

Subsequence containment by involutions
Aaron D. Jaggard

Trees and reflection groups.
Humberto Luiz Talpo ; Marcelo Firer

Counting peaks and valleys in \(k\)-colored Motzkin paths
A. Sapounakis ; P. Tsikouras

Splitting numbers of grids
Dwight Duffus ; Bill Sands

A simple proof of the Aztec diamond theorem
Sen-Peng Eu ; Tung-Shan Fu

The structure of maximum subsets of \(\{1,\dots,n\}\) with no solutions to \(a+b=kc\)
Andreas Baltz ; Peter Hegarty ; Jonas Knape ; Urban Larsson ; Tomasz Schoen

Ramsey \((K_ {1,2},K_ 3)\)-minimal graphs
M. Borowiecki ; I. Schiermeyer ; E. Sidorowicz

The combinatorics of orbital varieties closures of nilpotent order 2 in \(\text{sl}_ n\)
Anna Melnikov

Atomic Latin squares based on cyclotomic orthomorphisms
Ian M. Wanless

Random orders and gambler's ruin
Andreas Blass ; Gábor Braun

How different can two intersecting families be?
Balázs Patkós

Wilf classes of pairs of permutations of length 4
Ian Le

The hook fusion procedure.
James Grime

Faster algorithms for Frobenius numbers
Dale Beihoffer ; Jemimah Hendry ; Albert Nijenhuis ; Stan Wagon

On the Kronecker product \(s_{(n-p,p)}*s_\lambda\)
C. M. Ballantine ; R. C. Orellana

Asymptotic enumeration of dense 0-1 matrices with equal row sums and equal column sums
E. Rodney Canfield ; Brendan D. McKay

A triple lacunary generating function for Hermite polynomials
Ira M. Gessel ; Pallavi Jayawant

Sorting classes
M. H. Albert ; R. E. L. Aldred ; M. D. Atkinson ; C. C. Handley ; D. A. Holton ; D. J. McCaughan

Lower bound for the size of maximal nontraceable graphs
Marietjie Frick ; Joy Singleton

Long heterochromatic paths in edge-colored graphs
He Chen ; Xueliang Li

Computing the period of an Ehrhart quasi-polynomial
Kevin Woods

A determinant identity that implies Rogers-Ramanujan
Kristina C. Garrett

Indecomposable tilings of the integers with exponentially long periods
John P. Steinberger

Packing unit squares in a rectangle
Hiroshi Nagamochi

\(q\)-identities related to overpartitions and divisor functions
Amy M. Fu ; Alain Lascoux

Counting segmented permutations using bicoloured Dyck paths
Anders Claesson

Erdős-Ko-Rado theorems for uniform set-partition systems
Karen Meagher ; Lucia Moura

Sets in the plane with many concyclic subsets
R. H. Jeurissen

Steiner triple systems and existentially closed graphs
A. D. Forbes ; M. J. Grannell ; T. S. Griggs

A solution of two-person single-suit whist
Johan Wästlund

Two-person symmetric whist
Johan Wästlund

A relationship between the major index for tableaux and the charge statistic for permutations
Kendra Killpatrick

\(\omega\)-periodic graphs
Itai Benjamini ; Christopher Hoffman

The insertion encoding of permutations
Michael H. Albert ; Steve Linton ; Nik Ruškuc

An asymptotic result for the path partition conjecture
Marietjie Frick ; Ingo Schiermeyer

Decompositions of graphs into 5-cycles and other small graphs
Teresa Sousa

Minimum common string partition problem: hardness and approximations
Avraham Goldstein ; Petr Kolman ; Jie Zheng

Discrepancy games
Noga Alon ; Michael Krivelevich ; Joel Spencer ; Tibor Szabó

Longest induced cycles in circulant graphs
Elena D. Fuchs

The generalized Schröder theory
Chunwei Song

Bounds for the average \(L^p\)-extreme and the \(L^\infty\)-extreme discrepancy
Michael Gnewuch

Packing and covering a unit equilateral triangle with equilateral triangles
Yuqin Zhang ; Yonghui Fan

Asymptotics of generating the symmetric and alternating groups.
John D. Dixon

Locally restricted compositions. I. Restricted adjacent differences
Edward A. Bender ; E. Rodney Canfield

Some cyclic solutions to the three table Oberwolfach problem
M. A. Ollis

Combinatorics of singly-repairable families
Eugene M. Luks ; Amitabha Roy

Pattern avoidance classes and subpermutations
M. D. Atkinson ; M. M. Murphy ; N. Ruškuc

A note on three types of quasisymmetric functions
T. Kyle Petersen

An introduction to \(q\)-species
Kent E. Morrison

Kocay's lemma, Whitney's theorem, and some polynomial invariant reconstruction problems
Bhalchandra D. Thatte

Even bonds of prescribed directed parity
Sven Hartmann ; C.H.C. Little

Perfect codes in Cartesian products of 2-paths and infinite paths
Paul Dorbec ; Michel Mollard

Sunflowers in lattices
Geoffrey McKenna

Isomorphism classes of maximal intersecting uniform families are few
Geoffrey McKenna

5-sparse Steiner triple systems of order \(n\) exist for almost all admissible \(n\)
Adam Wolfe

Degree sequences of \(F\)-free graphs
Oleg Pikhurko ; Anusch Taraz

Permanents of Hessenberg (0,1)-matrices
D. D. Olesky ; Bryan Shader ; P. van den Driessche

A partition of connected graphs
Gus Wiseman

A combinatorial proof of a symmetric \(q\)-Pfaff-Saalschütz identity
Victor J. W. Guo ; Jiang Zeng

A note on an identity of Andrews
Zhizheng Zhang

Chain polynomials of distributive lattices are 75\% unimodal
Anders Björner ; Jonathan David Farley

A note on graphs without short even cycles
Thomas Lam ; Jacques Verstraëte

Extending arcs: an elementary proof
T. Alderson

Integer partitions with fixed subsums
Yu. Yakubovich

Rank-three matroids are Rayleigh
David G. Wagner

A Pfaffian-Hafnian analogue of Borchardt's identity
Masao Ishikawa ; Hiroyuki Kawamuko ; Soichi Okada

Parity theorems for statistics on domino arrangements
Mark A. Shattuck ; Carl G. Wagner

The Turán problem for hypergraphs on fixed size
Peter Keevash

Vizing-like conjecture for the upper domination of Cartesian products of graphs -- the proof
Boštjan Brešar

New lower bound for multicolor Ramsey numbers for even cycles
Tomasz Dzido ; Andrzej Nowik ; Piotr Szuca

A note on two multicolor Ramsey numbers
Alexander Engström

Triangulations and the Hajós conjecture
Bojan Mohar

A symmetric basis of the algebra of quasi-symmetric coinvariants
Frédéric Chapoton

Distinguishing Cartesian powers of graphs
Michael O. Albertson

The intersection structure of \(t\)-intersecting families
John Talbot

A simple proof for the existence of exponentially balanced Gray codes
I Nengah Suparta

A Sperner-type theorem for set-partition systems
Karen Meagher ; Lucia Moura ; Brett Stevens

The sum of degrees in cliques
Béla Bollobás ; Vladimir Nikiforov

The cover pebbling theorem
Jonas Sjöstrand

Pan-factorial property in regular graphs
M. Kano ; Qinglin Yu
  • À propos
  • Contact
  • Mentions légales
  • Politique de confidentialité