The extremal function for partial bipartite tilings

Details The extremal function for partial bipartite tilings The extremal function for partial bipartite tilings

2009-10-06

arxiv.org/abs/0910.1064v2

Mathematics

Combinatorics

10 pages

Scientific paper

For a fixed bipartite graph H and given number c, 0threshold T_H(c) which guarantees that any n-vertex graph with at edge density
at least T_H(c) contains $(1-o(1))c/v(H) n$ vertex-disjoint copies of H. In the
proof we use a variant of a technique developed by
Komlos~\bcolor{[Combinatorica 20 (2000), 203-218}]

Affiliated with

Also associated with

No associations

Rating

The extremal function for partial bipartite tilings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The extremal function for partial bipartite tilings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The extremal function for partial bipartite tilings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-358314