Abstract

For a graph $G=(V,E)$, a hypergraph $H$ is called a Berge-$G$ if there is a bijection $f:E(G)\mapsto E(H)$ such that $e\subseteq f(e)$ for all $e\in E(G)$. The family of Berge-$G$ hypergraphs is de...

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.