z-logo
open-access-imgOpen Access
Improving the Kruskal–Katona Bounds for Complete Subgraphs of a Graph
Author(s) -
Robert Cowen
Publication year - 2018
Publication title -
the mathematica journal
Language(s) - English
Resource type - Journals
eISSN - 1097-1610
pISSN - 1047-5974
DOI - 10.3888/tmj.20-6
Subject(s) - kruskal's algorithm , computer science , graph , combinatorics , theoretical computer science , mathematics , algorithm , minimum spanning tree

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom