Let G be a multipartite graph with partition V₁, V₂,…, Vₖ of $V(G)$. Let di,j denote the edge density of the pair (Vᵢ, Vⱼ). An independent transversal is an independent set of G with exactly one vertex in each Vᵢ. In this paper, we prove an asymptotically sharp upper bound on the maximum number of independent transversals given the di,j's.
No takes yet. Share an insight, caveat, or question.
Ruotolo et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: