There is no universal countable pentagon-free graph.

Gregory L. Cherlin Péter Komjáth

Published in: J. Graph Theory (1994)

Keyphrases

graph theory
directed graph
bipartite graph
graph representation
structured data
graph model
graph structure
graph theoretic
spanning tree
weighted graph
connected components
random walk
markov chain
lower bound
data structure
case study
graph partitioning
machine learning
database