A note on 3‐partite graphs without 4‐cycles
Sign Up to like & getrecommendations! Published in 2020 at "Journal of Combinatorial Designs"
DOI: 10.1002/jcd.21742
Abstract: Let C4 be a cycle of order 4. Write ex(n,n,n,C4) for the maximum number of edges in a balanced 3‐partite graph whose vertex set consists of three parts, each has n vertices that have no… read more here.
Keywords: graphs without; note partite; without cycles; partite graphs ... See more keywords