A proof of Mader's conjecture on large clique subdivisions in C4-free graphs.
Hong LiuRichard MontgomeryPublished in: J. Lond. Math. Soc. (2017)
Keyphrases
- maximum clique
- independent set
- graph properties
- quasi cliques
- maximum weight
- graph representation
- graph theoretic
- graph mining
- maximum independent set
- directed graph
- graph matching
- graph theory
- spanning tree
- linear logic
- complex structures
- branch and bound algorithm
- knowledge base
- data sets
- graph structure
- graph construction
- subgraph isomorphism
- series parallel
- bipartite graph
- knn
- special case
- pattern recognition
- bayesian networks