Erdös-type condition for a graph to contain k independent edges.
A. Pawel WojdaPublished in: Electron. Notes Discret. Math. (1999)
Keyphrases
- weighted graph
- directed graph
- undirected graph
- spanning tree
- directed acyclic graph
- edge weights
- random walk
- edge detector
- graph matching
- graph structure
- graph clustering
- structured data
- vertex set
- stable set
- graph model
- maximum matching
- sufficient conditions
- nodes of a graph
- data sets
- graph partitioning
- graph theory
- bipartite graph
- bayesian networks