The Library
The extremal function for partial bipartite tilings
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. doi:10.1016/j.ejc.2011.09.026 ISSN 01956698.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
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, Engineering and Medicine > Science > Mathematics | ||||
Journal or Publication Title: | European Journal of Combinatorics | ||||
Publisher: | Elsevier BV | ||||
ISSN: | 01956698 | ||||
Official Date: | July 2012 | ||||
Dates: |
|
||||
Volume: | Vol.33 | ||||
Number: | No.5 | ||||
Page Range: | pp. 807-815 | ||||
DOI: | 10.1016/j.ejc.2011.09.026 | ||||
Status: | Peer Reviewed | ||||
Publication Status: | Published | ||||
Access rights to Published version: | Restricted or Subscription Access |
Data sourced from Thomson Reuters' Web of Knowledge
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |