Abstract
Let H be a connected hypergraph with minimum degree δ(H), edge connectivity λ(H) and vertex connectivity κ(H). An r-uniform hypergraph is p-partite if its vertex set can be partitioned into p parts, and every edge contains at most one vertex from each part, where p≥r≥2. Volkmann (1989) and Topp and Volkmann (1993) established sufficient conditions on p-partite graphs G implying λ(G)=δ(G) or κ(G)=λ(G). In this paper we generalize these well-known results to p-partite uniform hypergraphs.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
