77 search results - page 8 / 16 » The Zeta Function of a Hypergraph |
JCO
2010
14 years 8 months ago
2010
We study the extremal parameter N(n, m, H) which is the largest number of copies of a hypergraph H that can be formed of at most n vertices and m edges. Generalizing previous work...
JCT
2011
14 years 4 months ago
2011
The f-regressive Ramsey number Rreg f (d, n) is the minimum N such that every colouring of the d-tuples of an N-element set mapping each x1, . . . , xd to a colour ≤ f(x1) contai...
DAM
2008
14 years 9 months ago
2008
We consider vertex coloring of an acyclic digraph G in such a way that two vertices which have a common ancestor in G receive distinct colors. Such colorings arise in a natural wa...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
The paper is organized as a self-contained literate Haskell program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmet...
ICML
2005
IEEE
15 years 10 months ago
2005
IEEE
In the information regularization framework by Corduneanu and Jaakkola (2005), the distributions of labels are propagated on a hypergraph for semi-supervised learning. The learnin...