'Complete multipartite graph' diaporamas de présentation

K 3 -design of K 2 n \ F with F a spanning odd forest

K 3 -design of K 2 n F with F a spanning odd forest. ? ? ? Department of Financial and Computational Mathematics Providence University A joint work with Professor Hung-Lin Fu. OUTLINE. Introduction Known Results Main Results. Introduction.

431 views • 35 slides

Extremal Graph Theory

Extremal Graph Theory. Ajit A. Diwan Department of Computer Science and Engineering, I. I. T. Bombay. Email: aad@cse.iitb.ac.in. Basic Question. Let H be a fixed graph. What is the maximum number of edges in a graph G with n vertices that does not contain H as a subgraph ?

698 views • 33 slides

Path kernels and partitions

313 views • 18 slides