Hypergraph Packing And Graph Embedding
نویسندگان
چکیده
We provide suucient conditions for packing two hypergraphs. The emphasis is on the asymptotic case when one of the hypergraphs has a bounded degree and the other is dense. As an application, we give an alternative proof for the bipartite case of the recently developed Blow-up Lemma 12].
منابع مشابه
Embedded Associated Primes of Powers of Square-free Monomial Ideals
An ideal I in a Noetherian ringR is normally torsion-free if Ass(R/I) = Ass(R/I) for all t ≥ 1. We develop a technique to inductively study normally torsion-free square-free monomial ideals. In particular, we show that if a squarefree monomial ideal I is minimally not normally torsion-free then the least power t such that I has embedded primes is bigger than β1, where β1 is the monomial grade o...
متن کاملEvaluation of Hierarchical Mesh Reorderings
Irregular and sparse scientific computing programs frequently experience performance losses because of inefficient use of the memory system in most machines. Previous work has shown that, for a graph model, performing a partitioning and then reordering within each partition (hierarchical reordering) improves performance. More recent work has shown that reordering heuristics based on a hypergrap...
متن کاملNearly-Perfect Hypergraph Packing is in NC
Answering a question of RR odl and Thoma, we show that the Nibble Algorithm for nding a collection of disjoint edges covering almost all vertices in an almost regular, uniform hypergraph with negligible pair degrees can be derandomized and parallelized to run in polylog time on polynomially many parallel processors. In other words, the nearly-perfect packing problem on this class of hypergraphs...
متن کاملA note on packing of two copies of a hypergraph
A 2-packing of a hypergraph H is a permutation σ on V (H) such that if an edge e belongs to E(H), then σ(e) does not belong to E(H). We prove that a hypergraph which does not contain neither empty edge ∅ nor complete edge V (H) and has at most 12n edges is 2-packable. A 1-uniform hypergraph of order n with more than 1 2n edges shows that this result cannot be improved by increasing the size of H.
متن کاملHypergraph Packing and Sparse Bipartite Ramsey Numbers
We prove that there exists a constant c such that, for any integer ∆, the Ramsey number of a bipartite graph on n vertices with maximum degree ∆ is less than 2n. A probabilistic argument due to Graham, Rödl and Ruciński implies that this result is essentially sharp, up to the constant c in the exponent. Our proof hinges upon a quantitative form of a hypergraph packing result of Rödl, Ruciński a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Combinatorics, Probability & Computing
دوره 8 شماره
صفحات -
تاریخ انتشار 1999