Abstract
A 3-uniform hypergraph is called a minimum 3-tree, if for any 3-coloring of its vertex set there is a heterochromatic edge and the hypergraph has the minimum possible number of edges. Here we show that the number of edges in such 3-tree is for any number of vertices n ≡ 3, 4 (mod 6). © 1999 John Wiley & Sons, Inc. J Graph Theory 30: 157-166, 1999
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.