Add to ORKGLet G be a simple balanced bipartite graph on 2n vertices, δ = δ(G)/n, and ρ0 = δ+√2δ−1 2. If δ ≥ 1/2 then G has a ⌊ρ0n⌋-regular spanning subgraph. The statement is nearly tight.
This thesis consists of three new fundamental results on the existence of spanning subgraphs in grap...
AbstractA parity subgraph of a graph is a spanning subgraph such that the degrees of each vertex hav...
AbstractLet Γ(n,e) denote the class of all simple graphs on n nodes and e edges. The number of spann...
Let X be a regular graph with degree k ≥ 3 and order n. Then the number of spanning trees of X is κ(...
Erdös proved that every graph G has a bipartite, spanning subgraph B such that dB(v) ≥ dG(v) 2 for a...
International audienceGeneralizing well-known results of Erd ̋os and Lov ́asz, we show that every gr...
Erdos proved the well-known result that every graph has a spanning, bipartite subgraph such that eve...
AbstractLet G be a d-regular simple graph with n vertices. Here it is proved that for d > n−1, G con...
The conjecture of Bollobás and Komlós, recently proved by Böttcher, Schacht, and Taraz [Math. Ann., ...
For a graph H, the extremal number ex(n,H) is the maximum number of edges in a graph of order n not ...
Let F be a family of graphs and let d be large enough. For every d-regular graph G, we study the exi...
AbstractA conjecture by Bollobás and Komlós states the following: For every γ>0 and integers r⩾2 and...
International audienceFor a given 2-partition (V1, V2) of the vertices of a (di)graph G, we study pr...
AbstractWe build on a previous result concerning regular simple graphs for which there is some λ>0 s...
AbstractA balanced bipartition of a graph G is a partition of V(G) into two subsets V1 and V2, which...
This thesis consists of three new fundamental results on the existence of spanning subgraphs in grap...
AbstractA parity subgraph of a graph is a spanning subgraph such that the degrees of each vertex hav...
AbstractLet Γ(n,e) denote the class of all simple graphs on n nodes and e edges. The number of spann...
Let X be a regular graph with degree k ≥ 3 and order n. Then the number of spanning trees of X is κ(...
Erdös proved that every graph G has a bipartite, spanning subgraph B such that dB(v) ≥ dG(v) 2 for a...
International audienceGeneralizing well-known results of Erd ̋os and Lov ́asz, we show that every gr...
Erdos proved the well-known result that every graph has a spanning, bipartite subgraph such that eve...
AbstractLet G be a d-regular simple graph with n vertices. Here it is proved that for d > n−1, G con...
The conjecture of Bollobás and Komlós, recently proved by Böttcher, Schacht, and Taraz [Math. Ann., ...
For a graph H, the extremal number ex(n,H) is the maximum number of edges in a graph of order n not ...
Let F be a family of graphs and let d be large enough. For every d-regular graph G, we study the exi...
AbstractA conjecture by Bollobás and Komlós states the following: For every γ>0 and integers r⩾2 and...
International audienceFor a given 2-partition (V1, V2) of the vertices of a (di)graph G, we study pr...
AbstractWe build on a previous result concerning regular simple graphs for which there is some λ>0 s...
AbstractA balanced bipartition of a graph G is a partition of V(G) into two subsets V1 and V2, which...
This thesis consists of three new fundamental results on the existence of spanning subgraphs in grap...
AbstractA parity subgraph of a graph is a spanning subgraph such that the degrees of each vertex hav...
AbstractLet Γ(n,e) denote the class of all simple graphs on n nodes and e edges. The number of spann...