Abstract
Ap-intersectionrepresentation of a graphGis a map,f, that assigns each vertex a subset of {1,2,…,t} such that {u,v} is an edge if and only if |f(u)∩f(v)|⩾p. The symbolθp(G) denotes this minimumtsuch that ap-intersection representation ofGexists. In 1966 Erdős, Goodman, and Pósa showed that for all graphsGon 2nvertices,θ1(G)⩽θ1(Kn,n)=n2. In 1992, Chung and West conjectured that for all graphsGon 2nvertices,θp(G)⩽θp(Kn,n) whenp⩾1. Subsequently, upper and lower bounds forθp(Kn,n) have been found to be (n2/p)(1+o(1)). We show in this paper that many complete unbalanced bipartite graphs on 2nvertices have a largerp-intersection number thanKn,n. For example, whenp=2,θ2(Kn,n)⩽12n2(1+o(1))<4172n2(1+o(1))⩽θ2(K(5/6)n,(7/6)n).
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.
