On edge independence numbers and edge covering numbers of -uniform hypergraph
František Olejník (1989)
Mathematica Slovaca
Similarity:
František Olejník (1989)
Mathematica Slovaca
Similarity:
Yair Caro, Josef Lauri, Christina Zarb (2015)
Discussiones Mathematicae Graph Theory
Similarity:
A constrained colouring or, more specifically, an (α, β)-colouring of a hypergraph H, is an assignment of colours to its vertices such that no edge of H contains less than α or more than β vertices with different colours. This notion, introduced by Bujtás and Tuza, generalises both classical hypergraph colourings and more general Voloshin colourings of hypergraphs. In fact, for r-uniform hypergraphs, classical colourings correspond to (2, r)-colourings while an important instance of...
Péter G.N. Szabó (2016)
Discussiones Mathematicae Graph Theory
Similarity:
In their paper, Bounds on the number of edges in hypertrees, G.Y. Katona and P.G.N. Szabó introduced a new, natural definition of hypertrees in k- uniform hypergraphs and gave lower and upper bounds on the number of edges. They also defined edge-minimal, edge-maximal and l-hypertrees and proved an upper bound on the edge number of l-hypertrees. In the present paper, we verify the asymptotic sharpness of the [...] upper bound on the number of edges of k-uniform hypertrees given in the...
Jiří Witzany (1987)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Ernest Jucovič, František Olejník (1974)
Časopis pro pěstování matematiky
Similarity:
Walter, Manfred (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity: