On the Erdos-Sos Conjecture for spiders in graphs having no path with 2k+1 vertices.
Adam GilbertGary TinerPublished in: Ars Comb. (2018)
Keyphrases
- weighted graph
- edge weights
- random graphs
- labeled graphs
- undirected graph
- attributed graphs
- shortest path
- adjacency matrix
- connected subgraphs
- hamiltonian cycle
- maximal cliques
- graph matching
- average degree
- graph theoretic
- maximum cardinality
- planar graphs
- directed edges
- directed graph
- graph theory
- graph representation
- graph structures
- graph databases
- bipartite graph
- endpoints
- graph structure
- query graph
- social networks
- minimum spanning tree
- finding the shortest path
- phase transition
- minimum length
- strongly connected
- graph model
- spanning tree
- real world networks
- graph clustering