Titlebook: ;

crutch

Computing the independence number of dense triangle-free graphs,s remains valid if the minimum degree is required to be large. While in general graphs this problem remains .-hard even within the class of graphs with minimum degree δ > (1 − ε)., the situation is different for triangle-free graphs. It will be shown that for triangle-free graphs with δ > ./3 the in

铁砧

青石板

gerontocracy

天然热喷泉

勾引

On greedy matching ordering and greedy matchable graphs, for which a vertex ordering exists such that the greedy algorithm always yields maximum cardinality matchings for each induced subgraph. We show that these graphs, called greedy matchable graphs, are a subclass of weakly triangulated graphs and contain strongly chordal graphs and chordal bipartite

使纠缠

Invigorate

AVID

Graph-Theoretic Concepts in Computer Science978-3-540-69643-8Series ISSN 0302-9743 Series E-ISSN 1611-3349

Aggregate

https://doi.org/10.1007/978-981-15-9456-4Let . be the value of the maximum cut of a graph .. Let . be the expectation of . for random graphs with . vertices and . edges and let . be the expectation of . for random 2.-regular graphs with . vertices. We prove, for sufficiently large .: