# Difference between revisions of "Triangle k Core"

Jump to navigation
Jump to search

(Created page with "will be filled soon...") |
|||

Line 1: | Line 1: | ||

− | + | =Triangle k Core= | |

+ | === Definition Triangle Core === | ||

+ | The triangle k-core of a simple undirected graph <math>G = (V,E)</math> is the inclusion maximal subgraph <math>C_{k}(G) \subset G</math> where each edge <math>e \in E(C_k(G))</math> is part of at least <math>k</math> triangles in <math>C_k(G)</math>. | ||

+ | |||

+ | More detailed background information is provided in | ||

+ | |||

+ | === Definition Triangle Core Number === | ||

+ | The triangle core number of an edge <math>e \in E(G)</math> is the maximal k such that <math>e \in C_k(G)</math> | ||

+ | |||

+ | Haha |

## Revision as of 14:34, 8 June 2015

# Triangle k Core

### Definition Triangle Core

The triangle k-core of a simple undirected graph is the inclusion maximal subgraph where each edge is part of at least triangles in .

More detailed background information is provided in

### Definition Triangle Core Number

The triangle core number of an edge is the maximal k such that

Haha