منابع مشابه
Smaller Subgraphs of Minimum Degree $k$
In 1990, Erdős, Faudree, Rousseau and Schelp proved that for k > 2 every graph with n > k+ 1 vertices and (k− 1)(n−k+ 2) + ( k−2 2 ) + 1 edges contains a subgraph of minimum degree k on at most n − √ n/6k3 vertices. They conjectured that it is possible to remove at least kn many vertices and remain with a subgraph of minimum degree k, for some k > 0. We make progress towards their conjecture by...
متن کاملGenerating Minimal k-Vertex Connected Spanning Subgraphs
We show that minimal k-vertex connected spanning subgraphs of a given graph can be generated in incremental polynomial time for any fixed k.
متن کاملDegree constrained subgraphs
In this paper, we present new structural results about the existence of a subgraph where the degrees of the vertices are pre-specified. Further, we use these results to prove a 16-edge-weighting version of a conjecture by Karoński, Luczak and Thomason, an asymptotic 2-edge-weighting version of the same conjecture, and a 7/8 version of Louigi’s Conjecture.
متن کاملOn the minimal degree implying equality of the largest triangle-free and bipartite subgraphs
Erdős posed the problem of finding conditions on a graph G that imply t (G)= b(G), where t (G) is the largest number of edges in a triangle-free subgraph and b(G) is the largest number of edges in a bipartite subgraph. Let δc be the least number so that any graph G on n vertices with minimum degree δcn has t (G)= b(G). Extending results of Bondy, Shen, Thomassé and Thomassen we show that 0.75 δ...
متن کاملMinimal Degree and (k, m)-Pancyclic Ordered Graphs
Given positive integers k £ m £ n, a graph G of order n is (k, m)-pancyclic ordered if for any set of k vertices of G and any integer r with m £ r £ n, there is a cycle of length r encountering the k vertices in a specified order. Minimum degree conditions that imply a graph of sufficiently large order n is (k, m)-pancylic ordered are proved. Examples showing that these constraints are best pos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1990
ISSN: 0012-365X
DOI: 10.1016/0012-365x(90)90162-b