arXiv Analytics

Sign in

arXiv:2412.01121 [math.CO]AbstractReferencesReviewsResources

Transversal Structures in Graph Systems: A Survey

Wanting Sun, Guanghui Wang, Lan Wei

Published 2024-12-02Version 1

Given a system $\mathcal{G} =\{G_1,G_2,\dots,G_m\}$ of graphs/digraphs/hypergraphs on the common vertex set $V$ of size $n$, an $m$-edge graph/digraph/hypergraph $H$ on $V$ is transversal in $\mathcal{G}$ if there exists a bijection $\phi :E(H)\rightarrow [m]$ such that $e \in E(G_{\phi(e)})$ for all $e\in E(H)$. In this survey, we consider extremal problems for transversal structures in graph systems. More precisely, we summarize some sufficient conditions that ensure the existence of transversal structures in graph/digraph/hypergraph systems, which generalize several classical theorems in extremal graph theory to transversal version. We also include a number of conjectures and open problems.

Comments: 24 pages, 2 figures
Categories: math.CO
Subjects: 05C35
Related articles: Most relevant | Search more
arXiv:2009.12692 [math.CO] (Published 2020-09-26)
Problems and results in Extremal Combinatorics -- IV
arXiv:0705.0938 [math.CO] (Published 2007-05-07)
Extremal Graph Theory for Metric Dimension and Diameter
arXiv:2202.06810 [math.CO] (Published 2022-02-14)
Codes with structured Hamming distance in graph families