Regarding Equitable Colorability Defect of Hypergraphs

From MaRDI portal




Abstract:

oindent Azarpendar and Jafari in 2020 proved the following inequality chi left( { m KG} ^r ({cal F} , s) ight) geq leftlceil frac{ { m ecd}^r left( {cal F} , leftlfloor frac{s}{2} ight floor ight) }{r-1} ight ceil , and noted that it is plausible that the above inequality remains true if one replaces leftlfloorfracs2ightfloor with s.

oindent In this paper, considering the relation mecdrleft(calF,xight)geqmcdrleft(calF,xight) which always holds, we show that even in the weaker inequality chi left( { m KG} ^r ({cal F} , s) ight) geq leftlceil frac{ { m cd}^r left( {cal F} , leftlfloor frac{s}{2} ight floor ight) }{r-1} ight ceil , no number x greater than leftlfloorfracs2ightfloor could be replaced by leftlfloorfracs2ightfloor.














This page was built for publication: Regarding Equitable Colorability Defect of Hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6419370)