International audienceGeneralizing well-known results of Erd ̋os and Lov ́asz, we show that every graph G contains a spanning k-partite subgraph H with λ(H) ≥ ⌈ k−1k λ(G)⌉, where λ(G) is the edge-connectivity of G. In particular, together with a well-known result due to Nash-Williams and Tutte, this implies that every 7-edge-connected graphs contains a spanning bipartite graph whose edge set decomposes into two edge-disjoint spanning trees. We show that this is best possible as it does not hold for infintely many 6-edge-connected graphs. For directed graphs, it was shown in [6] that there is no k such that every k-arc-connected digraph has a spanning strong bipartite subdigraph. We prove that every strong digraph has a spanning strong 3-par...
Let F be a family of graphs and let d be large enough. For every d-regular graph G, we study the exi...
A subgraph of a graph G is spanning if the subgraph covers all vertices of G. A path- factor of a gr...
This thesis consists of three new fundamental results on the existence of spanning subgraphs in grap...
AbstractIt is shown that every k-edge-connected digraph with m edges and n vertices contains a spann...
International audienceFor a given 2-partition (V1, V2) of the vertices of a (di)graph G, we study pr...
Let G be a simple balanced bipartite graph on 2n vertices, δ = δ(G)/n, and ρ0 = δ+√2δ−1 2. If δ ≥ 1/...
AbstractWe prove that every 6k-connected graph contains k edge-disjoint rigid (and hence 2-connected...
We consider the problem (MSSS) of finding the minimum number of arcs in a spanning strongly connecte...
AbstractAnswering a question of Adrian Bondy (Per. Comm.), we prove that every strong digraph has a ...
AbstractA conjecture by Bollobás and Komlós states the following: For every γ>0 and integers r⩾2 and...
AbstractGiven a graphG, let ak-trestle ofGbe a 2-connected spanning subgraph ofGof maximum degree at...
AbstractA digraph D is strong if it contains a directed path from x to y for every choice of vertice...
AbstractLet G be a 5-connected K1, d-free graph on n vertices. We show that G contains a 3-connected...
A conjecture by Bollobás and Komlós states the following: For every γ>0 and integers r⩾2 and Δ, ther...
AbstractWe present two extensions of a theorem by Alon and Yuster (1992, Graphs Comb., 8, 95–102) th...
Let F be a family of graphs and let d be large enough. For every d-regular graph G, we study the exi...
A subgraph of a graph G is spanning if the subgraph covers all vertices of G. A path- factor of a gr...
This thesis consists of three new fundamental results on the existence of spanning subgraphs in grap...
AbstractIt is shown that every k-edge-connected digraph with m edges and n vertices contains a spann...
International audienceFor a given 2-partition (V1, V2) of the vertices of a (di)graph G, we study pr...
Let G be a simple balanced bipartite graph on 2n vertices, δ = δ(G)/n, and ρ0 = δ+√2δ−1 2. If δ ≥ 1/...
AbstractWe prove that every 6k-connected graph contains k edge-disjoint rigid (and hence 2-connected...
We consider the problem (MSSS) of finding the minimum number of arcs in a spanning strongly connecte...
AbstractAnswering a question of Adrian Bondy (Per. Comm.), we prove that every strong digraph has a ...
AbstractA conjecture by Bollobás and Komlós states the following: For every γ>0 and integers r⩾2 and...
AbstractGiven a graphG, let ak-trestle ofGbe a 2-connected spanning subgraph ofGof maximum degree at...
AbstractA digraph D is strong if it contains a directed path from x to y for every choice of vertice...
AbstractLet G be a 5-connected K1, d-free graph on n vertices. We show that G contains a 3-connected...
A conjecture by Bollobás and Komlós states the following: For every γ>0 and integers r⩾2 and Δ, ther...
AbstractWe present two extensions of a theorem by Alon and Yuster (1992, Graphs Comb., 8, 95–102) th...
Let F be a family of graphs and let d be large enough. For every d-regular graph G, we study the exi...
A subgraph of a graph G is spanning if the subgraph covers all vertices of G. A path- factor of a gr...
This thesis consists of three new fundamental results on the existence of spanning subgraphs in grap...