The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The work deals with combinatorial problems concerning colorings of non-uniform hypergraphs. Let H=(V,E) be a hypergraph with minimum edge-cardinality n. We show that if H is a simple hypergraph (i.e. every two distinct edges have at most one common vertex) and∑e∈Er1−|e|⩽cn, for some absolute constant c>0, then H is r-colorable. We also obtain a stronger result for triangle-free simple hypergraphs...
The work deals with a generalization of Erdős–Lovász problem concerning colorings of non-uniform hypergraphs. Let H = (V, E) be a hypergraph and let $${{f_r(H)=\sum\limits_{e \in E}r^{1-|e|}}}$$ f r ( H ) = ∑ e ∈ E r 1 - | e | for some r ≥ 2. Erdős and Lovász proposed to find the value f (n) equal to the minimum possible value of f2(H) where H is 3-chromatic hypergraph with...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.