12,988 research outputs found
Embedding large subgraphs into dense graphs
What conditions ensure that a graph G contains some given spanning subgraph
H? The most famous examples of results of this kind are probably Dirac's
theorem on Hamilton cycles and Tutte's theorem on perfect matchings. Perfect
matchings are generalized by perfect F-packings, where instead of covering all
the vertices of G by disjoint edges, we want to cover G by disjoint copies of a
(small) graph F. It is unlikely that there is a characterization of all graphs
G which contain a perfect F-packing, so as in the case of Dirac's theorem it
makes sense to study conditions on the minimum degree of G which guarantee a
perfect F-packing.
The Regularity lemma of Szemeredi and the Blow-up lemma of Komlos, Sarkozy
and Szemeredi have proved to be powerful tools in attacking such problems and
quite recently, several long-standing problems and conjectures in the area have
been solved using these. In this survey, we give an outline of recent progress
(with our main emphasis on F-packings, Hamiltonicity problems and tree
embeddings) and describe some of the methods involved
Vertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights
Let be a graph and be a subset of . A vertex-coloring
-edge-weighting of is an assignment of weight by the
elements of to each edge of so that adjacent vertices have
different sums of incident edges weights.
It was proved that every 3-connected bipartite graph admits a vertex-coloring
-edge-weighting (Lu, Yu and Zhang, (2011) \cite{LYZ}). In this paper,
we show that the following result: if a 3-edge-connected bipartite graph
with minimum degree contains a vertex such that
and is connected, then admits a vertex-coloring
-edge-weighting for . In
particular, we show that every 2-connected and 3-edge-connected bipartite graph
admits a vertex-coloring -edge-weighting for . The bound is sharp, since there exists a family of
infinite bipartite graphs which are 2-connected and do not admit
vertex-coloring -edge-weightings or vertex-coloring
-edge-weightings.Comment: In this paper, we show that every 2-connected and 3-edge-connected
bipartite graph admits a vertex-coloring S-edge-weighting for S\in
{{0,1},{1,2}
Regular spanning subgraphs of bipartite graphs of high minimum degree
Let G be a simple balanced bipartite graph on vertices, , and . If then it has a -regular spanning subgraph. The
statement is nearly tight.Comment: submitte
- …