Jane Tan

activity

20192022

most citedProduct structure of graph classes with bounded treewidth

5 citations · 8 across the 9 of their papers we have counts for

collaborators

Showing 2021Show all

5 papers · 1 filter

math.AT2021

Graph Pseudometrics from a Topological Point of View

Ana Lucia Garcia-Pulido, Kathryn Hess, Jane Tan +3

We explore pseudometrics for directed graphs in order to better understand their topological properties. The directed flag complex associated to a directed graph provides a useful…

math.CO2021★ 2 cited

Counting partitions of $G_{n, 1/2}$ with degree congruence conditions

Paul Balister, Emil Powierski, Alex Scott +1

For $G = G_{n, 1/2}$ , the Erdős--Renyi random graph, let $X_{n}$ be the random variable representing the number of distinct partitions of $V (G)$ into sets $A_{1}, \dots, A_{q}$ so that th…

math.CO2021

Reconstruction from smaller cards

Carla Groenland, Tom Johnston, Alex Scott +1

The $ℓ$ -deck of a graph $G$ is the multiset of all induced subgraphs of $G$ on $ℓ$ vertices. We say that a graph is reconstructible from its $ℓ$ -deck if no other graph has…

math.CO2021

Reconstructing the degree sequence of a sparse graph from a partial deck

Carla Groenland, Tom Johnston, Andrey Kupavskii +3

The deck of a graph $G$ is the multiset of cards ${G - v : v \in V (G)}$ . Myrvold (1992) showed that the degree sequence of a graph on $n \geq 7$ vertices can be reconstructed from any d…

math.CO2021

A note on infinite antichain density

Paul Balister, Emil Powierski, Alex Scott +1

Let $F$ be an antichain of finite subsets of $N$ . How quickly can the quantities $∣ F \cap 2^{[n]} ∣$ grow as $n \to \infty$ ? We show that for any sequence…

Graph Pseudometrics from a Topological Point of View

Counting partitions of Gn,1/2​ with degree congruence conditions

Reconstruction from smaller cards

Reconstructing the degree sequence of a sparse graph from a partial deck

A note on infinite antichain density

Counting partitions of $G_{n, 1/2}$ with degree congruence conditions