Results 261 to 270 of about 56,162 (272)
Some of the next articles are maybe not open access.
Random Hypergraph Irregularity
SIAM Journal on Discrete Mathematics, 2016Summary: A hypergraph is \(k\)-irregular if there is no set of \(k\) vertices all of which have the same degree. We asymptotically determine the probability that a random uniform hypergraph is \(k\)-irregular.
Balister, Paul +3 more
openaire +1 more source
Mathematical Programming, 1997
We consider the capacitated minimum cost flow problem on directed hypergraphs. We define spanning hypertrees so generalizing the spanning tree of a standard graph, and show that, like in the standard and in the generalized minimum cost flow problems, a correspondence exists between bases and spanning hypertrees. Then, we show that, like for the network
CAMBINI, RICCARDO +2 more
openaire +4 more sources
We consider the capacitated minimum cost flow problem on directed hypergraphs. We define spanning hypertrees so generalizing the spanning tree of a standard graph, and show that, like in the standard and in the generalized minimum cost flow problems, a correspondence exists between bases and spanning hypertrees. Then, we show that, like for the network
CAMBINI, RICCARDO +2 more
openaire +4 more sources
Colorful hypergraphs in Kneser hypergraphs
2013Using a $Z_q$-generalization of a theorem of Ky Fan, we extend to Kneser hypergraphs a theorem of Simonyi and Tardos that ensures the existence of multicolored complete bipartite graphs in any proper coloring of a Kneser graph. It allows to derive a lower bound for the local chromatic number of Kneser hypergraphs (using a natural definition of what can
openaire +1 more source
2014
Authors: Mario Gionfriddo, Lorenzo Milazzo (Department of Mathematics and Computer Science, University of Catania, Italy), and Vitaly Voloshin (Department of Mathematics, Troy University, AL, US) Book Description: Combinatorial designs represent an important area of contemporary discrete mathematics closely related to such fields as finite geometries ...
Gionfriddo M +2 more
openaire +2 more sources
Authors: Mario Gionfriddo, Lorenzo Milazzo (Department of Mathematics and Computer Science, University of Catania, Italy), and Vitaly Voloshin (Department of Mathematics, Troy University, AL, US) Book Description: Combinatorial designs represent an important area of contemporary discrete mathematics closely related to such fields as finite geometries ...
Gionfriddo M +2 more
openaire +2 more sources