Overlap number of graphs

DOI10.1002/JGT.20596MaRDI QIDQ2888876zbMATH OpenOpenAlexFDO

Authors Daniel W. Cranston, Nitish Korula, Timothy D. Lesaulnier, Kevin G. Milans, Christopher J. Stocker, Jennifer Vandenbussche, Douglas B. West

Publication date 4 June 2012

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1007.0804

zbMATH Keywords

treeplanar graphintersection numberintersection representationoverlap representation

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Abstract: An {it overlap representation} of a graph $G$ assigns sets to vertices so that vertices are adjacent if and only if their assigned sets intersect with neither containing the other. The {it overlap number} $ol(G)$ (introduced by Rosgen) is the minimum size of the union of the sets in such a representation. We prove the following: (1) An optimal overlap representation of a tree can be produced in linear time, and its size is the number of vertices in the largest subtree in which the neighbor of any leaf has degree 2. (2) If $delta(G)ge2$ and $Ge{K}_3$, then $ol(G)le|E(G)|-1$, with equality when $G$ is connected and triangle-free and has no star-cutset. (3) If $G$ is an $n$-vertex plane graph with $nge5$, then $ol(G)le2n-5$, with equality when every face has length 4 and there is no star-cutset. (4) If $G$ is an $n$-vertex graph with $nge14$, then $ol(G)lefloor{n}^2/4-n/2-1$, and this is sharp (for even $n$, equality holds when $G$ arises from $K_{n/2,n/2}$ by deleting a perfect matching).

Recommendations

• Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph
• Covering the edges of a graph by a prescribed tree with minimum overlap
• The overlap chromatic numbers of wheel graphs
• scientific article; zbMATH DE number 1792588
• The total interval number of a graph

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• Intersection representation of complete unbalanced bipartite graphs
• The Representation of a Graph by Set Intersections
• The \(p\)-intersection number of a complete bipartite graph and orthogonal double coverings of a clique

Cited in

(4)

• Recognition of overlap graphs
• Systems of overlap representation for families of intervals
• Equivalence of the filament and overlap graphs of subtrees of limited trees
• Hierarchical overlap graph

This page was built for publication: Overlap number of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2888876)