Hostname: page-component-cd9895bd7-hc48f Total loading time: 0 Render date: 2024-12-25T17:50:11.273Z Has data issue: false hasContentIssue false
  • English
  • Français

Independent Transversals and Independent Coverings in Sparse Partite Graphs

Published online by Cambridge University Press:  01 March 1997

RAPHAEL YUSTER
RAPHAEL YUSTER
Affiliation:
Department of Mathematics, Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel
Get access Rights & Permissions [Opens in a new window]

Abstract

An [n, k, r]-partite graph is a graph whose vertex set, V, can be partitioned into n pairwise-disjoint independent sets, V1, …, Vn, each containing exactly k vertices, and the subgraph induced by Vi ∪ Vj contains exactly r independent edges, for 1 [les ] i < j [les ] n. An independent transversal in an [n, k, r]-partite graph is an independent set, T, consisting of n vertices, one from each Vi. An independent covering is a set of k pairwise-disjoint independent transversals. Let t(k, r) denote the maximal n for which every [n, k, r]-partite graph contains an independent transversal. Let c(k, r) be the maximal n for which every [n, k, r]-partite graph contains an independent covering. We give upper and lower bounds for these parameters. Furthermore, our bounds are constructive. These results improve and generalize previous results of Erdo″s, Gyárfás and Łuczak [5], for the case of graphs.

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 6 , Issue 1 , March 1997 , pp. 115 - 125
Copyright
1997 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)