Results 31 to 40 of about 5,199,165 (252)
Minimal forbidden sets for degree sequence characterizations [PDF]
, 2015 Given a set F of graphs, a graph G is F-free if G does not contain any member of as an induced subgraph. A set F is degree-sequence-forcing (DSF) if, for each graph G in the class C of -free graphs, every realization of the degree sequence of G is also ...
Barrus, Michael D., Hartke, Stephen G.
core +1 more source
A Constructive Extension of the Characterization on Potentially Ks,t-Bigraphic Pairs
Discussiones Mathematicae Graph Theory, 2017 Let Ks,t be the complete bipartite graph with partite sets of size s and t. Let L1 = ([a1, b1], . . . , [am, bm]) and L2 = ([c1, d1], . . . , [cn, dn]) be two sequences of intervals consisting of nonnegative integers with a1 ≥ a2 ≥ . . . ≥ am and c1 ≥ c2
Guo Ji-Yun, Yin Jian-Hua
doaj +1 more source
Component Order Edge Connectivity, Vertex Degrees, and Integer Partitions
Theory and Applications of GraphsGiven a finite, simple graph G, the k-component order connectivity (resp. edge connectivity) of G is the minimum number of vertices (resp. edges) whose removal results in a subgraph in which every component has an order of at most k − 1.
Michael R. Yatauro
doaj +1 more source
On balanced bipartitions of graphs
AKCE International Journal of Graphs and Combinatorics, 2020 Bollobás and Scott conjectured that every graph G has a balanced bipartite spanning subgraph H such that for each for each In this paper, we consider the contrary side and show that every graphic sequence has a realization G which admits a balanced ...
Guangnuan Li
doaj +1 more source
3-Paths in Graphs with Bounded Average Degree
Discussiones Mathematicae Graph Theory, 2016 In this paper we study the existence of unavoidable paths on three vertices in sparse graphs. A path uvw on three vertices u, v, and w is of type (i, j, k) if the degree of u (respectively v, w) is at most i (respectively j, k). We prove that every graph
Jendrol Stanislav +3 more
doaj +1 more source
Finding planted partitions in random graphs with general degree distributions [PDF]
, 2009 We consider the problem of recovering a planted partition such as a coloring, a small bisection, or a large cut in an (apart from that) random graph. In the last 30 years many algorithms for this problem have been developed that work provably well on ...
Coja-Oghlan, Amin +3 more
core +1 more source
Asymptotic enumeration of orientations of a graph as a function of the out-degree sequence [PDF]
, 2020 We prove an asymptotic formula for the number of orientations with given out-degree (score) sequence for a graph G. The graph G is assumed to have average degrees at least n1/3+ε for some ε > 0, and to have strong mixing properties, while the maximum ...
Iyer, Tejas +2 more
core +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Allogeneic hematopoietic stem cell transplantation (alloHSCT) is an essential therapy for several malignant and nonmalignant diseases, but relapse and graft loss remain the principal threats to its success. Routine monitoring of chimerism and minimal residual disease (MRD) enables early detection of imminent recurrence and guides ...
Carmen Junk +10 more
wiley +1 more source
Computing the sum of k largest Laplacian eigenvalues of tricyclic graphs [PDF]
Discrete Mathematics Letters, 2022 Pawan Kumar +2 more
doaj +1 more source
Pediatric Idiopathic Multicentric Castleman Disease Is Often Severe But Responsive to Siltuximab
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Idiopathic multicentric Castleman disease (iMCD) is a potentially fatal immunologic disorder marked by widespread lymphadenopathy and inflammation. Siltuximab, an interleukin‐6 (IL‐6) inhibitor, is the only FDA‐approved treatment for adult patients with iMCD.
Bridget Austin +17 more
wiley +1 more source