Counting extensions revisited
Work
Year: 2022
Type: article
Abstract: We consider rooted subgraphs in random graphs, that is, extension counts such as (i) the number of triangles containing a given vertex or (ii) the number of paths of length three connecting two given... more
Source: Random Structures and Algorithms
Authors Matas Šileikis, Lutz Warnke
Institutions Czech Academy of Sciences, Institute of Computer Science, Czech Academy of Sciences, Georgia Institute of Technology
Cites: 37
Cited by: 2
Related to: 10
FWCI: 1.139
Citation percentile (by year/subfield): 43.31
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
Funders National Science Foundation, Grantová Agentura České Republiky, Grantová Agentura České Republiky
Grant IDS DMS‐1945481, GJ20‐27757Y, GA19‐08740S