The Library
The extremal function for partial bipartite tilings
Tools
Tools
Tools
Grosu, Codruţ and Hladký, Jan. (2012) The extremal function for partial bipartite tilings. European Journal of Combinatorics, Vol.33 (No.5). pp. 807-815. ISSN 01956698
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1016/j.ejc.2011.09.026
Abstract
For a fixed bipartite graph H and given α∈(0,1), we determine the threshold TH(α) which guarantees that any n-vertex graph with at least edges contains vertex-disjoint copies of H. In the proof, we use a variant of a technique developed by Komlós [J. Komlós, Tiling Turán theorems, Combinatorica 20 (2) (2000) 203–218].
| Item Type: | Journal Article |
|---|---|
| Divisions: | Faculty of Science > Mathematics |
| Journal or Publication Title: | European Journal of Combinatorics |
| Publisher: | Elsevier BV |
| ISSN: | 01956698 |
| Date: | July 2012 |
| Volume: | Vol.33 |
| Number: | No.5 |
| Page Range: | pp. 807-815 |
| Identification Number: | 10.1016/j.ejc.2011.09.026 |
| Status: | Peer Reviewed |
| Publication Status: | Published |
| Access rights to Published version: | Restricted or Subscription Access |
| URI: | http://wrap.warwick.ac.uk/id/eprint/44748 |
Data sourced from Thomson Reuters' Web of Knowledge
Actions (login required)
 |
View Item |
