Let n, k, r be positive integers, with n ≥ kr. The r-uniform Kneser hypergraph KGr(n, k) has as vertex set the set of all k-subsets of the set {1,…,n} and its (hyper) edges are formed by the r-tuples of pairwise disjoint ...

Confirming a conjecture of Gyarfas, we prove that, for all natural numbers k and r, the vertices of every r-edge-colored complete k-uniform hypergraph can be partitioned into a bounded number (independent of the size of ...

A hypergraph is Helly if every family of hyperedges of it, formed by pairwise intersecting hyperedges, has a common vertex. We consider the concepts of bipartite-conformal and (colored) bipartite-Helly hypergraphs. In the ...

© 2018 Wiley Periodicals Inc. We show that for every η > 0 there exists an integer n 0 such that every 2-coloring of the 3-uniform complete hypergraph on n ≥ n 0 vertices contains two disjoint monochromatic tight cycles ...

For fixed positive integers r, k and E with 1 <= l < r and an r-uniform hypergraph H, let kappa(H, k, l) denote the number of k-colorings of the set of hyperedges of H for which any two hyperedges in the same color ...

La búsqueda y recuperación de datos multimodales es una importante tarea dentro del campo de búsqueda y recuperación de información, donde las consultas y los elementos de la base de datos objetivo están representados por ...