Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
2-core
Description:
The maximal subgraph in which every vertex has degree at least two, studied in graph theory and random graph models.
Primary topic:
Limits and Structures in Graph Theory (34%)
Related topics:
Limits and Structures in Graph Theory (34%),
Complex Network Analysis Techniques (11%)
OpenAlex ID:
keywords/2-core
Fast and simple decycling and dismantling of networks
2016
·
Lenka Zdeborová
, Pan Zhang
, et al.
·
Scientific Reports
·
194
PDF
Counting connected graphs inside-out
2004
·
Boris Pittel
, Nicholas C. Wormald
·
Journal of Combinatorial Theory Series B
·
104
The Satisfiability Threshold fork-XORSAT
2015
·
BORIS PITTEL
, GREGORY B. SORKIN
·
Combinatorics Probability Computing
·
77
Anatomy of the giant component: The strictly supercritical regime
2013
·
Jian Ding
, Eyal Lubetzky
, et al.
·
European Journal of Combinatorics
·
50
PDF
Large-deviation properties of the largest biconnected component for random graphs
2019
·
Hendrik Schawe
, Alexander K. Hartmann
·
The European Physical Journal B
·
44
PDF
Large-deviation properties of the largest 2-core component for random graphs
2017
·
Alexander K. Hartmann
·
The European Physical Journal Special Topics
·
42
Targeted damage to interdependent networks
2018
·
G. J. Baxter
, G. Timár
, et al.
·
Physical review. E
·
36
PDF
The Satisfiability Threshold for k-XORSAT
2012
·
Pittel, Boris
, Sorkin, Gregory B.
·
London School of Economics and Political Science Research Online (London School of Economics and Political Science)
·
36
PDF
Diameters in Supercritical Random Graphs Via First Passage Percolation
2010
·
JIAN DING
, JEONG HAN KIM
, et al.
·
Combinatorics Probability Computing
·
33
PDF
Resilience of perfect matchings and Hamiltonicity in random graph processes
2018
·
Rajko Nenadov
, Angelika Steger
, et al.
·
Random Structures and Algorithms
·
28
PDF
Asymptotics in percolation on high‐girth expanders
2020
·
Michael Krivelevich
, Eyal Lubetzky
, et al.
·
Random Structures and Algorithms
·
27
PDF
Growth diagrams, domino insertion and sign-imbalance
2004
·
Thomas Lam
·
Journal of Combinatorial Theory Series A
·
27
Hecke Algebras of TypeAwithq=−1
1996
·
Gordon James
, Andrew Mathas
·
Journal of Algebra
·
25
Counting partitions on the abacus
2007
·
Mark Wildon
·
The Ramanujan Journal
·
21
PDF
Finding a 2-Core of a Tree in Linear Time
2002
·
Biing-Feng Wang
·
SIAM Journal on Discrete Mathematics
·
21
On the Rank of a Random Binary Matrix
2019
·
Colin Cooper
, Alan Frieze
, et al.
·
The Electronic Journal of Combinatorics
·
18
PDF
The exact rank of sparse random graphs
2025
·
Margalit Glasgow
, Matthew Kwan
, et al.
·
Journal of the European Mathematical Society
·
16
CoreGDM: Geometric Deep Learning Network Decycling and Dismantling
2023
·
Marco Grassia
, Giuseppe Mangioni
·
Springer proceedings in complexity
·
16
Satisfiability Thresholds beyond k −XORSAT
2012
·
Andreas Goerdt
, Lutz Falke
·
Lecture notes in computer science
·
16
21+ mixing at isobaric analog resonances in N ≈ 82 nuclei
1970
·
H.R. Hiddleston
, P.J. Riley
·
Physics Letters B
·
14
Anatomy of a Gaussian giant: supercritical level-sets of the free field on regular graphs
2023
·
Guillaume Conchon-Kerjan
·
Electronic Journal of Probability
·
13
PDF
How does the core sit inside the mantle?
2015
·
Amin Coja‐Oghlan
, Oliver Cooley
, et al.
·
Random Structures and Algorithms
·
13
PDF
Random Graphs from a Weighted Minor-Closed Class
2013
·
Colin McDiarmid
·
The Electronic Journal of Combinatorics
·
13
PDF
The sharp threshold for making squares
2018
·
Paul Balister
, Béla Bollobás
, et al.
·
Annals of Mathematics
·
12
PDF
On the Rigidity of Sparse Random Graphs
2016
·
Nati Linial
, Jonathan Mosheiff
·
Journal of Graph Theory
·
12
PDF
Show more works
View as search
Works count:
91
Citation count:
1,068
Year
Topic
Type