178 search results - page 12 / 36 » combinatorics 2007 |
97
Voted
COMBINATORICS
2007
15 years 19 days ago
2007
We generalize the classical work of de Bruijn, Knuth and Rice (giving the asymptotics of the average height of Dyck paths of length n) to the case of p–watermelons with a wall (...
71
Voted
COMBINATORICS
2007
15 years 19 days ago
2007
Recently, Storm [8] defined the Ihara-Selberg zeta function of a hypergraph, and gave two determinant expressions of it. We define the Bartholdi zeta function of a hypergraph, a...
102
click to vote
COMBINATORICS
2007
15 years 19 days ago
2007
This paper deals with new infinite families of small dense sets in desarguesian projective planes PG(2, q). A general construction of dense sets of size about 3q2/3 is presented....
COMBINATORICS
2007
15 years 19 days ago
2007
In this paper, we prove that in a multigraph whose density Γ exceeds the maximum vertex degree ∆, the collection of minimal clusters (maximally dense sets of vertices) is cycle...
COMBINATORICS
2007
15 years 19 days ago
2007
In this note we present a short proof of the following result, which is a slight extension of a nice 2005 theorem by Kano and Yu. Let e be an edge of an rregular graph G. If G has...