Parcourir par

  • Collections
  • Sources

Geodesic


    Parcourir par

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


On the twin designs with the Ionin-type parameters
H. Kharaghani

Resolving triple systems into regular configurations
E. Mendelsohn ; G. Quattrocchi

Diagonal checker-jumping and Eulerian numbers for color-signed permutations
Niklas Eriksen ; Henrik Eriksson ; Kimmo Eriksson

Restricted set addition in groups. II: A generalization of the Erdős-Heilbronn conjecture
Vsevolod F. Lev

Where the typical set partitions meet and join
Boris Pittel

A note on symmetric powers of the standard representation of \(S_n\)
D. Savitt ; R. P. Stanley

Online coloring known graphs
M. M. Halldórsson

Random sampling of labeled tournaments
Lisa McShine

Combinatorial statistics on type-B analogues of noncrossing partitions and restricted permutations
Rodica Simion

Evolutionary families of sets
C. H. C. Little ; A. E. Campbell

Linear codes over finite chain rings
Thomas Honold ; Ivan Landjev

The characteristic polynomial of a graph is reconstructible from the characteristic polynomials of its vertex-deleted subgraphs and their complements
Elias M. Hagos

Some pairwise balanced designs
Malcolm Greig

Parity systems and the delta-matroid intersection problem
André Bouchet ; Bill Jackson

Low rank co-diagonal matrices and Ramsey graphs
Vince Grolmusz

Interchangeability of relevant cycles in graphs
Petra M. Gleiss ; Josef Leydold ; Peter F. Stadler

Restricted permutations, continued fractions, and Chebyshev polynomials
Toufik Mansour ; Alek Vainshtein

Constrainted graph processes
Béla Bollobás ; Oliver Riordan

A note on sparse random graphs and cover graphs
Tom Bohman ; Alan Frieze ; Miklós Ruszinkó ; Lubos Thoma

Composition sum identities related to the distribution of coordinate values in a discrete simplex
R. Milson

Improved upper bounds for self-avoiding walks in \(\mathbb Z^d\)
André Pönitz ; Peter Tittmann

The strongly regular (40, 12, 2, 4) graphs
E. Spence

The action of the symmetric group on a generalized partition semilattice
Robert Gill

A short proof of a partion relation for triples
Albin L. Jones

Trees and matchings
Richard W. Kenyon ; James G. Propp ; David B. Wilson

min-wise independent linear permutations
Tom Bohman ; Colin Cooper ; Alan Frieze

Bijections for hook pair identities
C. Krattenthaler

Harmonic functions on multiplicative graphs and interpolation polynomials
Alexei Borodin ; Grigori Olshanski

A note on the non-colorability threshold of a random graph
Alexis C. Kaporis ; Lefteris M. Kirousis ; Yannis C. Stamatiou

A note on the number of \((k,l)\)-sum-free sets
Tomasz Schoen

Separability number and Schurity number of coherent configurations
Sergei Evdokimov ; Ilia Ponomarenko

Symmetric sum-free partitions and lower bounds for Schur numbers
Harold Fredricksen ; Melvin M. Sweet

Asymptotics for the probability of connectedness and the distribution of number of components
Jason P. Bell ; Edward A. Bender ; Peter J. Cameron ; L. Bruce Richmond

Counting pattern-free set partitions. II: Noncrossing and other hypergraphs
Martin Klazar

Some bijective correspondences involving domino tableaux
Marc A. A. van Leeuwen

When structures are almost surely connected
Jason P. Bell

A large dihedral symmetry of the set of alternating sign matrices
Benjamin Wieland

Automorphisms and enumeration of switching classes of tournaments
L. Babai ; P. J. Cameron

A note on the asymptotic behavior of the heights in \(b\)-trees for \(b\) large
Charles Knessl ; Wojciech Szpankowski

Counting lattice paths by Narayana polynomials
Robert A. Sulanke

A note on random minimum length spanning trees
Alan Frieze ; Miklós Ruszinkó ; Lubos Thoma

The Hamiltonian \(p\)-median problem
Holger Glaab ; Alexander Pott

Bound graph polysemy
Paul J. Tanenbaum

Tournament sequences and Meeussen sequences
Matthew Cook ; Michael Kleber

Continued fractions and Catalan problems
Mahendra Jani ; Robert G. Rieper

Improving dense packings of equal disks in a square
David W. Boll ; Jerry Donovan ; Ronald L. Graham ; Boris D. Lubachevsky

A Turán type problem concerning the powers of the degrees of a graph
Yair Caro ; Raphael Yuster

Linear discrepancy of basic totally unimodular matrices
Benjamin Doerr

Two new extensions of the Hales-Jewett theorem
Randall McCutcheon

An asymptotic expansion for the number of permutations with a certain number of inversions
Lane Clark

A quasi-spectral characterization of strongly distance-regular graphs
M. A. Fiol

A Ramsey treatment of symmetry
T. Banakh ; O. Verbitsky ; Ya. Vorobets

A complete categorization of when generalized Tribonacci sequences can be avoided by additive partitions
Mike Develin

Franklin's argument proves an identity of Zagier
Robin Chapman

Large equiangular sets of lines in euclidean space
D. de Caen

Frequency squares and affine designs
V C Mavron

On the number of perfect matchings and Hamilton cycles in \(\varepsilon\)-regular non-bipartite graphs
Alan Frieze

Tight upper bounds for the domination numbers of graphs with given order and minimum degree. II
W. Edwin Clark ; Larry A. Dunning ; Stephen Suen

On descents in standard Young tableaux
Peter A. Hästö

Colouring planar mixed hypergraphs
André Kündgen ; Eric Mendelsohn ; Vitaly Voloshin

Determinantal expression and recursion for Jack polynomials
Luc Lapointe ; A. Lascoux ; J. Morse

An infinite antichain of permutations
Daniel A. Spielman ; Miklós Bóna

Note on Gy. Elekes's conjectures concerning unavoidable patterns in proper colorings
Vera Rosta

An inequality related to Vizing's conjecture
W. Edwin Clark ; Stephen Suen

A construction method for complete sets of mutually orthogonal frequency squares
V C Mavron

A determinant of the Chudnovskys generalizing the elliptic Frobenius-Stickelberger-Cauchy determinantal identity
Tewodros Amdeberhan
  • À propos
  • Contact
  • Mentions légales
  • Politique de confidentialité