Parcourir par

  • Collections
  • Sources

Geodesic


    Parcourir par

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


On 3-harness weaving: cataloging designs generated by fundamental blocks having distinct rows and columns
Shelley L. Rasmussen

Automated proofs for some Stirling number identities
Manuel Kauers ; Carsten Schneider

On identifying codes in the King grid that are robust against edge deletions
Iiro Honkala ; Tero Laihonen

The minor crossing number of graphs with an excluded minor
Drago Bokal ; Gašper Fijavž ; David R. Wood

Explicit Ramsey graphs and Erdős distance problems over finite Euclidean and non-Euclidean spaces
Le Anh Vinh

Almost product evaluation of Hankel determinants
Ömer Eğecioğlu ; Timothy Redmond ; Charles Ryavec

Osculating paths and oscillating tableaux
Roger E. Behrend

Constructing fifteen infinite classes of nonregular bipartite integral graphs
Ligong Wang ; Cornelis Hoede

Vector spaces and the Petersen graph
Marcelo H. de Carvalho ; C. H. C. Little

Algebraically solvable problems: describing polynomials as equivalent to explicit solutions
Uwe Schauz

Envy-free cake divisions cannot be found by finite protocols
Walter Stromquist

Avoiding rainbow induced subgraphs in vertex-colorings
Maria Axenovich ; Ryan Martin

Symmetric simplicial pseudoline arrangements
Leah Wrenn Berman

Shifted set families, degree sequences, and plethysm
C. Klivans ; V. Reiner

Transversal lattices
Joseph E. Bonin

Computing parametric rational generating functions with a primal Barvinok algorithm
Matthias Köppe ; Sven Verdoolaege

\(q\)-Eulerian polynomials and polynomials with only real zeros
Shi-Mei Ma ; Yi Wang

Maximal nontraceable graphs with toughness less than one
Frank Bullock ; Marietjie Frick ; Joy Singleton ; Susan van Aardt ; Kieka (C.M.) Mynhardt

Ear decompositions in combed graphs
Marcelo H. de Carvalho ; C. H. C. Little

Edit distance and its computation
József Balogh ; Ryan Martin

Coefficients of functional compositions often grow smoothly
Edward A. Bender ; E. Rodney Canfield ; L. Bruce Richmond

Spherical F-tilings by triangles and \(r\)-sided regular polygons, \(r \geq 5\)
Catarina P. Avelino ; Altino F. Santos

An inverse matrix formula in the right-quantum algebra
Matjaž Konvalinka

An anti-Ramsey condition on trees
Michael E. Picollelli

Minimum rank of matrices described by a graph or pattern over the rational, real and complex numbers
Avi Berman ; Shmuel Friedland ; Leslie Hogben ; Uriel G. Rothblum ; Bryan Shader

Extremal problems for \(t\)-partite and \(t\)-colorable hypergraphs
Dhruv Mubayi ; John Talbot

The maximum piercing number for some classes of convex sets with the \((4,3)\)-property
Jan Kynčl ; Martin Tancer

Graph-based upper bounds for the probability of the union of events
Pierangela Veneziani

Dominating sets of random 2-in 2-out directed graphs
Stephen Howe

Using algebraic properties of minimal idempotents for exhaustive computer generation of association schemes
K. Coolsaet ; J. Degraer

Nonexistence of triples of nonisomorphic connected graphs with isomorphic connected \(P_{3}\)-graphs
Xueliang Li ; Yan Liu

On the resilience of long cycles in random graphs
Domingos Dellamonica Jr ; Yoshiharu Kohayakawa ; Martin Marciniszyn ; Angelika Steger

Spanning trees with many leaves and average distance
Ermelinda DeLaViña ; Bill Waller

The 99th Fibonacci identity
Arthur T. Benjamin ; Alex K. Eustis ; Sean S. Plott

Generating function identities for \(\zeta (2n+2)\), \(\zeta (2n+3)\) via the WZ method
Kh. Hessami Pilehrood ; T. Hessami Pilehrood

Two coefficients of the Dyson product
Lun Lv ; Guoce Xin ; Yue Zhou

On a covering problem for equilateral triangles
Adrian Dumitrescu ; Minghui Jiang

The combinatorics of the Garsia-Haiman modules for hook shapes
Ron M. Adin ; Jeffrey B. Remmel ; Yuval Roichman

On pattern-avoiding partitions
Vít Jelínek ; Toufik Mansour

Small group divisible Steiner quadruple systems
Artem A. Zhuravlev ; Melissa S. Keranen ; Donald L. Kreher

Induced trees in triangle-free graphs
Jiří Matoušek ; Robert Šámal

Codes from cubic curves and their extensions
T. L. Alderson ; A. A. Bruen

The IC-indices of complete bipartite graphs
Chin-Lin Shiue ; Hung-Lin Fu

Circular chromatic index of generalized Blanuša snarks
Mohammad Ghebleh

An elementary proof of the hook formula
Jason Bandlow

The crossing number of a projective graph is quadratic in the face-width
I. Gitler ; P. Hliněný ; J. Leaños ; G. Salazar

On the Turán properties of infinite graphs
Andrzej Dudek ; Vojtěch Rödl

The lonely runner with seven runners
J. Barajas ; O. Serra

Chromatic graphs, Ramsey numbers and the flexible atom conjecture
Jeremy F. Alm ; Roger D. Maddux ; Jacob Manske

Determining lower bounds for packing densities of non-layered patterns using weighted templates
Cathleen Battiste Presutti

The map asymptotics constant \(t_{g}\)
Edward A. Bender ; Zhicheng Gao ; L. Bruce Richmond

A refinement of the formula for \(k\)-ary trees and the Gould-Vandermonde's convolution
Ricky X. F. Chen

Area distribution and scaling function for punctured polygons
Christoph Richard ; Iwan Jensen ; Anthony J. Guttmann

A new family of Somos-like recurrences
Paul Heideman ; Emilie Hogan

On the failing cases of the Johnson bound for error-correcting codes
Wolfgang Haas

Completing partial Latin squares with two filled rows and two filled columns
Peter Adams ; Darryn Bryant ; Melinda Buchanan

On rainbow connection
Yair Caro ; Arie Lev ; Yehuda Roditty ; Zsolt Tuza ; Raphael Yuster

A quantified version of Bourgain's sum-product estimate in \(\mathbb F_{p}\) for subsets of incomparable sizes
M. Z. Garaev

On rainbow trees and cycles
Alan Frieze ; Michael Krivelevich

Large holes in quasi-random graphs
Joanna Polcyn

Major indices and perfect bases for complex reflection groups.
Robert Shwartz ; Ron M. Adin ; Yuval Roichman

The MacNeille completion of the poset of partial injective functions
Marc Fortin

Determinant expressions for \(q\)-harmonic congruences and degenerate Bernoulli numbers
Karl Dilcher

A cluster expansion formula (\(A_{n}\) case)
Ralf Schiffler

Derangements and Euler's difference table for \(C_{l} \wr S_{n}\)
Hilarion L. M. Faliharimalala ; Jiang Zeng

Van der Waerden/Schrijver-Valiant like conjectures and stable (aka hyperbolic) homogeneous polynomials: one theorem for all
Leonid Gurvits

\(R(3,4)=17\)
Paweł Prałat

Graphs associated with codes of covering radius 1 and minimum distance 2
Joanne L. Hall

A multivariate interlace polynomial and its computation for graphs of bounded clique-width
Bruno Courcelle

Biased positional games and small hypergraphs with large covers
Michael Krivelevich ; Tibor Szabó

On the Eulerian enumeration of involutions
Chak-On Chow

Game chromatic number of Cartesian product graphs
T. Bartnicki ; B. Brešar ; J. Grytczuk ; M. Kovše ; Z. Miechowicz ; I. Peterin

The Garnir relations for Weyl groups of type \(C_n\).
Himmet Can

The lollipop graph is determined by its spectrum
R. Boulet ; B. Jouve

On growth rates of permutations, set partitions, ordered graphs and other objects
Martin Klazar

A combinatorial derivation with Schröder paths of a determinant representation of Laurent biorthogonal polynomials
Shuhei Kamioka

On the number of planar orientations with prescribed degrees
Stefan Felsner ; Florian Zickfeld

Asymptotically optimal box packing theorems
Michael Reid

Unit rectangle visibility graphs
Alice M. Dean ; Joanna A. Ellis-Monaghan ; Sarah Hamilton ; Greta Pangborn

Hurwitz equivalence in tuples of generalized quaternion groups and dihedral groups.
Xiang-dong Hou

On the doubly refined enumeration of alternating sign matrices and totally symmetric self-complementary plane partitions
Tiago Fonseca ; Paul Zinn-Justin

Irregularity strength of regular graphs
Jakub Przybyło

Words with simple Burrows-Wheeler transforms
Jamie Simpson ; Simon J. Puglisi

Products of factorial Schur functions
Victor Kreiman

Augmented rook boards and general product formulas
Brian K. Miceli ; Jeffrey Remmel

Crossings and nestings in tangled diagrams
William Y. C. Chen ; Jing Qin ; Christian M. Reidys

Nonexistence of almost Moore digraphs of diameter three
J. Conde ; J. Gimbert ; J. Gonzàlez ; J. M. Miret ; R. Moreno

The 11-element case of Frankl's conjecture
Ivica Bošnjak ; Petar Marković

Asymptotics of coefficients of multivariate generating functions: Improvements for smooth points
Alexander Raichev ; Mark C. Wilson

Totally greedy coin sets and greedy obstructions
L. J. Cowen ; Robert Cowen ; Arthur Steinberg

Dihedral \(f\)-tilings of the sphere by equilateral and scalene triangles. II
A. M. d'Azevedo Breda ; Patrícia S. Ribeiro ; Altino F. Santos

Counting defective parking functions
Peter J Cameron ; Daniel Johannsen ; Thomas Prellberg ; Pascal Schweitzer

Tree-thickness and caterpillar-thickness under girth constraints
Qi Liu ; Douglas B. West

Generating random elements in finite groups.
John D. Dixon

Construction of minimal bracketing covers for rectangles
Michael Gnewuch

The scattering matrix of a graph
Hirobumi Mizuno ; Iwao Sato

A character on the quasi-symmetric functions coming from multiple zeta values
Michael E. Hoffman

R-S correspondence for \((\mathbb Z_{2} \times \mathbb Z_{2}) \wr S_{n}\) and Klein-4 diagram algebras
M. Parvathi ; B. Sivakumar

Notes on nonrepetitive graph colouring
János Barát ; David R. Wood

Circular degree choosability
Serguei Norine ; Xuding Zhu

A uniform approach to complexes arising from forests
Mario Marietti ; Damiano Testa

New infinite families of almost-planar crossing-critical graphs
Petr Hliněný

Quartet compatibility and the quartet graph
Stefan Grünewald ; Peter J. Humphries ; Charles Semple

On the discrepancy of quasi-progressions
Sujith Vijay

Distribution of segment lengths in genome rearrangements
Glenn Tesler

The Loebl-Komlós-Sós conjecture for trees of diameter 5 and for certain caterpillars
Diana Piguet ; Maya Jakobine Stein

Distinct distances in graph drawings
Paz Carmi ; Vida Dujmović ; Pat Morin ; David R. Wood

Circular digraph walks, \(k\)-balanced strings, lattice paths and Chebychev polynomials
Evangelos Georgiadis ; David Callan ; Qing-Hu Hou

Tutte polynomial, subgraphs, orientations and sandpile model: new connections via embeddings
Olivier Bernardi

On the number of matchings in regular graphs
S. Friedland ; E. Krop ; K. Markström

On the \(\mathcal S_{n}\)-modules generated by partitions of a given shape
Daniel Kane ; Steven Sivek

Factoring \((16, 6, 2)\) Hadamard difference sets
Chirashree Bhattacharya ; Ken W. Smith

On unimodality problems in Pascal's triangle
Xun-Tuan Su ; Yi Wang

The number of graphs not containing \(K_{3,3}\) as a minor
Stefanie Gerke ; Omer Giménez ; Marc Noy ; Andreas Weißl

Compression of root systems and the \(E\)-sequence
Kevin Purbhoo

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.
Weidong Gao ; Yuanlin Li ; Jiangtao Peng ; Fang Sun

Saturation numbers of books
Guantao Chen ; Ralph J. Faudree ; Ronald J. Gould

Graphs with given degree sequence and maximal spectral radius
Türker Bıyıkoğlu ; Josef Leydold

Laplacian integral graphs with maximum degree 3
Steve Kirkland

On the chromatic number of simple triangle-free triple systems
Alan Frieze ; Dhruv Mubayi

Degree constrained orientations in countable graphs
Attila Bernáth ; Henning Bruhn

Global alliances and independent domination in some classes of graphs
Odile Favaron

Star coloring high girth planar graphs
Craig Timmons

Generalizations of partial difference sets from cyclotomy to nonelementary Abelian \(p\)-groups
John Polhill

The Ramsey number of diamond-matchings and loose cycles in hypergraphs
András Gyárfás ; Gábor N. Sárközy ; Endre Szemerédi

An algorithmic Friedman-Pippenger theorem on tree embeddings and applications
Domingos Dellamonica Jr ; Yoshiharu Kohayakawa

Balancing cyclic \(R\)-ary Gray codes. II.
Mary Flahive

The spectral excess theorem for distance-regular graphs: a global (over)view
Edwin R. van Dam

\((\ell,0)\)-Carter partitions, their crystal-theoretic behavior and generating function
Chris Berg ; Monica Vazirani

Partitioning 3-edge-colored complete equi-bipartite graphs by monochromatic trees under a color degree condition
Xueliang Li ; Fengxia Liu

Variations on descents and inversions in permutations
Denis Chebikin

Discovering hook length formulas by an expansion technique
Guo-Niu Han

Generalisations of the Tits representation
Daan Krammer

Towards the distribution of the size of a largest planar matching and largest planar subgraph in random bipartite graphs
Marcos Kiwi ; Martin Loebl

Strongly maximal matchings in infinite graphs
Ron Aharoni ; Eli Berger ; Agelos Georgakopoulos ; Philipp Sprüssel

More constructions for Turan's (3,4)-conjecture
Andrew Frohmader

Heterochromatic matchings in edge-colored graphs
Guanghui Wang ; Hao Li

New graphs of finite mutation type
Harm Derksen ; Theodore Owen

On certain eigenspaces of cographs
Torsten Sander

Universally image partition regularity
Dibyendu De ; Ram Krishna Paul

Regularisation and the Mullineux map.
Matthew Fayers

An extremal characterization of projective planes
Stefaan De Winter ; Felix Lazebnik ; Jacques Verstraëte

On the first eigenvalue of bipartite graphs
Amitava Bhattacharya ; Shmuel Friedland ; Uri N. Peled

On the dispersions of the polynomial maps over finite fields
Uwe Schauz

Nonhomogeneous parking functions and noncrossing partitions
Drew Armstrong ; Sen-Peng Eu

Dihedral f-tilings of the sphere by equilateral and scalene triangles. III.
A. M. d'Azevedo Breda ; Patrícia S. Ribeiro ; Altino F. Santos

A complete grammar for decomposing a family of graphs into 3-connected components
Guillaume Chapuy ; Éric Fusy ; Mihyun Kang ; Bilyana Shoilekova

Jack deformations of Plancherel measures and traceless Gaussian random matrices
Sho Matsumoto

A traceability conjecture for oriented graphs
Marietjie Frick ; Susan A van Aardt ; Jean E Dunbar ; Morten H Nielsen ; Ortrud R Oellermann

Orthogonal systems in vector spaces over finite fields
Alex Iosevich ; Steven Senger

Small integral trees
A. E. Brouwer

Random \(k\)-sat: the limiting probability for satisfiability for moderately growing \(k\)
Amin Coja-Oghlan ; Alan Frieze

Extension of strongly regular graphs
Ralucca Gera ; Jian Shen

Identifying codes of Cartesian product of two cliques of the same size
S. Gravier ; J. Moncel ; A. Semri

A natural series for the natural logarithm
Oliver T. Dasbach

Graphs with many copies of a given subgraph
Vladimir Nikiforov

Characterizing cell-decomposable metrics
Katharina T. Huber ; Jacobus Koolen ; Vincent Moulton ; Andreas Spillner

Convexly independent subsets of the Minkowski sum of planar point sets
Friedrich Eisenbrand ; János Pach ; Thomas Rothvoß ; Nir B. Sopher

Intersecting and cross-intersecting families of labeled sets
Peter Borg

A note on the component structure in random intersection graphs with tunable clustering
Andreas N. Lagerås ; Mathias Lindholm

Lattice points in Minkowski sums
Christian Haase ; Benjamin Nill ; Andreas Paffenholz ; Francisco Santos

A combinatorial proof of Andrews' smallest parts partition function
Kathy Qing Ji

The maximum number of perfect matchings in graphs with a given degree sequence
Noga Alon ; Shmuel Friedland

How long can a graph be kept planar?
V. Anuradha ; Chinmay Jain ; Jack Snoeyink ; Tibor Szabó

An identity generator: basic commutators
M. Farrokhi D. G.

Necklace bisection with one cut less than needed
Gábor Simonyi

Induced paths in twin-free graphs
David Auger

A note on palindromic delta-vectors for certain rational polytopes
Matthew H. J. Fiset ; Alexander M. Kasprzyk

A note about Bezdek's conjecture on covering an annulus by strips
Yuqin Zhang ; Ren Ding

Bijective proofs of identities from colored binary trees
Sherry H.F. Yan

Generalized descents and normality
Miklós Bóna

A note on polynomials and \(f\)-factors of graphs
Hamed Shirazi ; Jacques Verstraëte

A sharp bound for the reconstruction of partitions
Vincent Vatter

Unextendible sequences in finite abelian groups
Jujuan Zhuang

Partitions and edge colourings of multigraphs
Alexandr V. Kostochka ; Michael Stiebitz

Rainbow \(H\)-factors of complete \(s\)-uniform \(r\)-partite hypergraphs
Ailian Chen ; Fuji Zhang ; Hao Li

On the diameter of matroid ports
Jaume Martí-Farré ; Carles Padró ; Leonor Vázquez

The number of 0-1-2 increasing trees as two different evaluations of the Tutte polynomial of a complete graph
C. Merino

Evaluation of a multiple integral of Tefera via properties of the exponential distribution
Yaming Yu

On base partitions and cover partitions of skew characters
Christian Gutschwager

Coupon collecting with quotas
Russell May

On the number of orthogonal systems in vector spaces over finite fields
Le Anh Vinh

An extremal doubly even self-dual code of length 112
Masaaki Harada

For each \(\alpha > 2\) there is an infinite binary word with critical exponent \(\alpha \)
James D. Currie ; Narad Rampersad

A note on neighbour-distinguishing regular graphs total-weighting
Jakub Przybyło

Uniquely Hamiltonian characterizations of distance-hereditary and parity graphs
Terry A. McKee

On the non-existence of certain hyperovals in dual André planes of order 2\(^{2h}\)
Angela Aguglia ; Luca Giuzzi

On domination in 2-connected cubic graphs
B. Y. Stodolsky

A note on \(K_{k,k}\)-cross free families
Andrew Suk

Quantitative sum product estimates on different sets
Chun-Yen Shen

Bordered conjugates of words over large alphabets
Tero Harju ; Dirk Nowotka

A pairing strategy for tic-tac-toe on the integer lattice with numerous directions
Klay Kruczek ; Eric Sundberg

A counterexample to a conjecture of Erdős, Graham and Spencer
Song Guo

Graphs of morphisms of graphs
R. Brown ; I. Morris ; J. Shrimpton ; C. D. Wensley
  • À propos
  • Contact
  • Mentions légales
  • Politique de confidentialité