The uniform hypergraph bound for the vertex-stable-set invariant

From papers

Let H=(V,calE){\cal H}=(V,{cal E}) be a hypergraph with V=n|V|=n, no isolated vertices, and every edge hcalEh\in{cal E} of size rr. Let σv(H)\sigma_v({\cal H}) and α(H)\alpha({\cal H}) be the stated vertex-stable-set invariants. The uniform hypergraph conjecture. If

σv(H)=α(H),\sigma_v({\cal H})=\alpha({\cal H}),

then

rsigmav(H)n.rsigma_v({\cal H})\leq n.

This conjecture was attributed in the source to an earlier thesis; no resolution is given in the supplied text.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Isidoro Gitler and Carlos E. Valencia, “On bounds for some graph invariants”, arXiv:math/0510387 (2013).

Solutions 0

No solutions have been posted yet.