An asymptotically sharp bound on the maximum number of independent transversals (Q6131742)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An asymptotically sharp bound on the maximum number of independent transversals |
scientific article; zbMATH DE number 7834203
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An asymptotically sharp bound on the maximum number of independent transversals |
scientific article; zbMATH DE number 7834203 |
Statements
An asymptotically sharp bound on the maximum number of independent transversals (English)
0 references
18 April 2024
0 references
Summary: Let \(G\) be a multipartite graph with partition \(V_1, V_2, \ldots, V_k\) of \(V(G)\). Let \(d_{i,j}\) denote the edge density of the pair \((V_i, V_j)\). An independent transversal is an independent set of \(G\) with exactly one vertex in each \(V_i\). In this paper, we prove an asymptotically sharp upper bound on the maximum number of independent transversals given the \(d_{i,j}\)'s.
0 references
odd cycle decomposition of a graph
0 references
geometric mean
0 references
0.8259320259094238
0 references
0.8191832304000854
0 references
0.8157938122749329
0 references
0.8125700354576111
0 references
0.806826114654541
0 references