AbstractA graph G is said to be packable by the graph F if its edges can be partitioned into copies of F. It is called randomly packable if what remains after deletion of the edges of a proper subgraph that is F-packable is also F-packable. We establish some results on graphs that are randomly packable by matchings, paths, complete graphs, and others
For a fixed graph H with t vertices, an H-factor of a graph G with n vertices, where t divides n, is...
For a fixed graph H with t vertices, an H-factor of a graph G with n vertices, where t divides n, is...
A graph is called equipackable if every maximal packing in it is also maximum. This generalizes rand...
AbstractA graph G is said to be packable by the graph F if its edges can be partitioned into copies ...
AbstractA graph G is packable by the graph F if its edges can be partitioned into copies of F. If de...
There are many results dealing with the problem of decomposing a fixed graph into isomorphic subgrap...
AbstractA graph is called equipackable if every maximal packing in it is also maximum. This generali...
We determine to within a constant factor the threshold for the property that two random k-uniform hy...
We determine to within a constant factor the threshold for the property that two random k-uniform hy...
We determine to within a constant factor the threshold for the property that two random k-uniform hy...
AbstractA graph is called equipackable if every maximal packing in it is also maximum. This generali...
For a fixed graph H with t vertices, an H-factor of a graph G with n vertices, where t divides n, is...
AbstractA nonempty graph G is randomly H-decomposable if every family of edge-disjoint subgraphs of ...
AbstractA graph is packable if it is a subgraph of its complement. The following statement was conje...
AbstractA graph G is H-decomposable if it can be expressed as an edge-disjoint union of subgraphs, e...
For a fixed graph H with t vertices, an H-factor of a graph G with n vertices, where t divides n, is...
For a fixed graph H with t vertices, an H-factor of a graph G with n vertices, where t divides n, is...
A graph is called equipackable if every maximal packing in it is also maximum. This generalizes rand...
AbstractA graph G is said to be packable by the graph F if its edges can be partitioned into copies ...
AbstractA graph G is packable by the graph F if its edges can be partitioned into copies of F. If de...
There are many results dealing with the problem of decomposing a fixed graph into isomorphic subgrap...
AbstractA graph is called equipackable if every maximal packing in it is also maximum. This generali...
We determine to within a constant factor the threshold for the property that two random k-uniform hy...
We determine to within a constant factor the threshold for the property that two random k-uniform hy...
We determine to within a constant factor the threshold for the property that two random k-uniform hy...
AbstractA graph is called equipackable if every maximal packing in it is also maximum. This generali...
For a fixed graph H with t vertices, an H-factor of a graph G with n vertices, where t divides n, is...
AbstractA nonempty graph G is randomly H-decomposable if every family of edge-disjoint subgraphs of ...
AbstractA graph is packable if it is a subgraph of its complement. The following statement was conje...
AbstractA graph G is H-decomposable if it can be expressed as an edge-disjoint union of subgraphs, e...
For a fixed graph H with t vertices, an H-factor of a graph G with n vertices, where t divides n, is...
For a fixed graph H with t vertices, an H-factor of a graph G with n vertices, where t divides n, is...
A graph is called equipackable if every maximal packing in it is also maximum. This generalizes rand...
DOI
Add to ORKG