On the Number of Edge-Disjoint Triangles in K 4-Free Graphs.

Ervin Györi Balázs Keszegh

Published in: Comb. (2017)

Keyphrases

small number
real time
data sets
maximum number
three dimensional
computational complexity
graphical models
memory requirements
spanning tree
undirected graph
random graphs
total length
edge disjoint