2 citations · 2 across the 6 of their papers we have counts for
5 papers · 1 filter
Social Networks: Enumerating Maximal Community Patterns in -Closed Graphs
Gabriela Bourla, Kaixin Wang, Fan Wei +1
Jacob Fox, C. Seshadhri, Tim Roughgarden, Fan Wei, and Nicole Wein introduced the model of -closed graphs--a distribution-free model motivated by triadic closure, one of the mos…
Lollipop and Cubic Weight Functions for Graph Pebbling
Marshall Yang, Carl Yerger, Runtian Zhou
Given a configuration of pebbles on the vertices of a graph , a pebbling move removes two pebbles from a vertex and puts one pebble on an adjacent vertex. The pebbling number of…
Outerplanar Turán number of a cycle
Ervin Győri, Guilherme Zeus Dantas e Moura, Runtian Zhou
A graph is outerplanar if it has a planar drawing for which all vertices belong to the outer face of the drawing. Let be a graph. The outerplanar Turán number of , denoted b…
The planar Turán number of and
Ervin Győri, Alan Li, Runtian Zhou
Let be a set of graphs. The planar Turán number, , is the maximum number of edges in an -vertex planar graph which does not contain…
The planar Turán number of the seven-cycle
Ervin Győri, Alan Li, Runtian Zhou
The planar Turán number, , is the maximum number of edges in an -vertex planar graph which does not contain as a subgraph. The topic of extremal planar…