On the public citation graph
A Survey of Minimum Saturated Graphs
0 signed · 177 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/(sici)1097-0118(199609)23:1<1::aid-jgt1>3.3.co;2-3openalex-snapshot
On k -saturated graphs with restrictions on the degrees
inferredcites →https://doi.org/10.1002/1520-6610(2001)9:2<100::aid-jcd1001>3.0.co;2-wopenalex-snapshot
Constructing designs straightforwardly: Worst arising cases
inferredcites →https://doi.org/10.1002/jgt.21668openalex-snapshot
Cycle-Saturated Graphs with Minimum Number of Edges
inferredcites →https://doi.org/10.1002/jgt.3190100109openalex-snapshot
Minimal k‐saturated and color critical graphs of prescribed minimum degree
inferredcites →https://doi.org/10.1002/jgt.3190100209openalex-snapshot
Saturated graphs with minimal number of edges
inferredcites →https://doi.org/10.1002/jgt.3190180103openalex-snapshot
Maximal triangle‐free graphs with restrictions on the degrees
inferredcites →https://doi.org/10.1002/jgt.3190180606openalex-snapshot
On maximal triangle‐free graphs
inferredcites →https://doi.org/10.1007/bf01858469openalex-snapshot
Maximally non-hamiltonian graphs of girth 7
inferredcites →https://doi.org/10.1007/bf02023582openalex-snapshot
Smallest maximally nonhamiltonian graphs
inferredcites →https://doi.org/10.1007/bf02349959openalex-snapshot
Smallest maximally nonhamiltonian graphs II
inferredcites →https://doi.org/10.1007/bfb0066187openalex-snapshot
Quelques problemes concernant les cliques des hypergraphes h-complets et q-parti h-complets
inferredcites →https://doi.org/10.1007/pl00021182openalex-snapshot
Minimal Oriented Graphs of Diameter 2
inferredcites →https://doi.org/10.1007/s00373-011-1128-9openalex-snapshot
Saturation Numbers for Nearly Complete Graphs
inferredcites →https://doi.org/10.1007/s003730170012openalex-snapshot
Uniform Families and Count Matroids
inferredcites →https://doi.org/10.1016/0012-365x(74)90074-0openalex-snapshot
Hypohamiltonian and hypotraceable graphs
inferredcites →https://doi.org/10.1016/0012-365x(79)90129-8openalex-snapshot
On diameter critical graphs
inferredcites →https://doi.org/10.1016/0012-365x(91)90035-zopenalex-snapshot
Saturated r-uniform hypergraphs
inferredcites →https://doi.org/10.1016/0012-365x(91)90140-wopenalex-snapshot
Asymptotic results on saturated graphs
inferredcites →https://doi.org/10.1016/0012-365x(92)90692-9openalex-snapshot
Asymptotic growth of sparse saturated structures is locally determined
inferredcites →https://doi.org/10.1016/0012-365x(95)00173-topenalex-snapshot
Cycle-saturated graphs of minimum size
inferredcites →https://doi.org/10.1016/0012-365x(95)00301-copenalex-snapshot
Uniquely (m, k) -colourable graphs and k − τ-saturated graphs
inferredcites →https://doi.org/10.1016/0097-3165(85)90048-2openalex-snapshot
An extremal problem for sets with applications to graph theory
inferredcites →https://doi.org/10.1016/0097-3165(93)90081-iopenalex-snapshot
An extremal problem for sets: A new approach via Bezoutians
inferredcites →https://doi.org/10.1016/j.dam.2005.05.035openalex-snapshot
Hamiltonian path saturated graphs with small size
inferredcites →https://doi.org/10.1016/j.disc.2005.11.039openalex-snapshot
Cubic maximal nontraceable graphs
inferredcites →https://doi.org/10.1016/j.disc.2005.11.063openalex-snapshot
Smallest claw-free, 2-connected, nontraceable graphs and the construction of maximal nontraceable graphs
inferredcites →https://doi.org/10.1016/j.disc.2005.11.085openalex-snapshot
Size of weakly saturated graphs
inferredcites →https://doi.org/10.1016/j.disc.2006.08.004openalex-snapshot
Minimum degree and the minimum size of K2t -saturated graphs
inferredcites →https://doi.org/10.1016/j.disc.2007.08.006openalex-snapshot
Small maximally disjoint union-free families
inferredcites →https://doi.org/10.1016/j.disc.2008.06.036openalex-snapshot
tKp -saturated graphs of minimum size
inferredcites →https://doi.org/10.1016/s0012-365x(02)00371-0openalex-snapshot
C4-saturated bipartite graphs
inferredcites →https://doi.org/10.1016/s0012-365x(74)80019-1openalex-snapshot
Non-hamiltonian cubic planar maps
inferredcites →https://doi.org/10.1016/s0012-365x(99)00309-xopenalex-snapshot
Asymptotic evaluation of the sat-function for r-stars
inferredcites →https://doi.org/10.1016/s0195-6698(82)80025-5openalex-snapshot
An Extremal Problem for two Families of Sets
inferredcites →https://doi.org/10.1016/s0304-0208(08)72824-xopenalex-snapshot
Weakly Saturated Graphs are Rigid
inferredcites →https://doi.org/10.1017/s0963548301004746openalex-snapshot
Weakly Saturated Hypergraphs and Exterior Algebra
inferredcites →https://doi.org/10.1017/s0963548399003971openalex-snapshot
The Minimum Size of Saturated Hypergraphs
inferredcites →https://doi.org/10.1080/00029890.1975.11993805openalex-snapshot
Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
inferredcites →https://doi.org/10.1137/080715275openalex-snapshot
A General Lower Bound for Potentially H -Graphic Sequences
inferredcites →https://doi.org/10.37236/1055openalex-snapshot
Constructive Upper Bounds for Cycle-Saturated Graphs of Minimum Size
inferredcites →https://doi.org/10.37236/1929openalex-snapshot
Lower Bound for the Size of Maximal Nontraceable Graphs
inferredcites →https://doi.org/10.4153/cjm-1965-072-1openalex-snapshot
A Theorem on k-Saturated Graphs
inferredcites →https://doi.org/10.4153/cmb-1972-012-3openalex-snapshot
Variations on the Hamiltonian Theme
inferredcites →https://doi.org/10.4310/joc.2010.v1.n2.a5openalex-snapshot
The saturation function of complete partite graphs
inferredcites →https://doi.org/10.4310/joc.2011.v2.n3.a5openalex-snapshot
Saturation numbers for families of Ramsey-minimal graphs
inferredcites →https://doi.org/10.48550/arxiv.0909.1970openalex-snapshot
On Minimum Saturated Matrices
inferredcites →https://doi.org/10.7151/dmgt.1039openalex-snapshot
On some variations of extremal graph problems
inferredcites →https://doi.org/10.7151/dmgt.1076openalex-snapshot
Graphs maximal with respect to absence of hamiltonian paths
inferredcites →https://doi.org/10.7151/dmgt.1225openalex-snapshot
P_m-saturated bipartite graphs with minimum size
inferredcites →https://doi.org/10.82444/warw.33671311openalex-snapshot
A note on minimum K2,3-saturated graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4506735openalex-extracted
The Minimum Size of Matching-Saturated Graphs
inferred← citeshttps://doi.org/10.1002/jgt.21625openalex-snapshot
Saturation numbers for families of graph subdivisions
inferred← citeshttps://doi.org/10.1002/jgt.22033openalex-snapshot
Saturation Numbers in Tripartite Graphs
inferred← citeshttps://doi.org/10.1002/jgt.22132openalex-snapshot
Colored Saturation Parameters for Rainbow Subgraphs
inferred← citeshttps://doi.org/10.1002/jgt.22525openalex-snapshot
Few H copies in F ‐saturated graphs
inferred← citeshttps://doi.org/10.1002/jgt.23097openalex-snapshot
Edge-Minimum Saturated k-Planar Drawings
inferred← citeshttps://doi.org/10.1002/rsa.20814openalex-snapshot
The random k ‐matching‐free process
inferred← citeshttps://doi.org/10.1002/rsa.70009openalex-snapshot
A Jump of the Saturation Number in Random Graphs?
inferred← citeshttps://doi.org/10.1007/978-3-030-83823-2_129openalex-snapshot
Cycle Saturation in Random Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-53174-7_28openalex-snapshot
Saturated Simple and 2-simple Topological Graphs with Few Edges
inferred← citeshttps://doi.org/10.1007/s00373-014-1422-4openalex-snapshot
On the Number of Edges in a Minimum $$C_6$$ C 6 -Saturated Graph
inferred← citeshttps://doi.org/10.1007/s00373-014-1514-1openalex-snapshot
Saturation Numbers for Linear Forests $$P_5 \cup tP_2$$ P 5 ∪ t P 2
inferred← citeshttps://doi.org/10.1007/s00373-015-1589-3openalex-snapshot
Uniquely Tree-saturated Graphs
inferred← citeshttps://doi.org/10.1007/s00373-019-02047-wopenalex-snapshot
A Note on Saturation for Berge-G Hypergraphs
inferred← citeshttps://doi.org/10.1007/s00373-019-02054-xopenalex-snapshot
$$C_{2k}$$-Saturated Graphs with No Short Odd Cycles
inferred← citeshttps://doi.org/10.1007/s00454-026-00833-xopenalex-snapshot
Faces in Girth-Saturated Graphs on Surfaces
inferred← citeshttps://doi.org/10.1007/s10489-024-05966-1openalex-snapshot
An original model for multi-target learning of logical rules for knowledge graph reasoning
inferred← citeshttps://doi.org/10.1007/s11083-022-09622-6openalex-snapshot
The Saturation Spectrum for Antichains of Subsets
inferred← citeshttps://doi.org/10.1016/j.akcej.2019.04.003openalex-snapshot
Weak saturation numbers of and
inferred← citeshttps://doi.org/10.1016/j.amc.2020.125204openalex-snapshot
A note on rainbow saturation number of paths
inferred← citeshttps://doi.org/10.1016/j.amc.2023.128097openalex-snapshot
Weak saturation number of a complete bipartite graph
inferred← citeshttps://doi.org/10.1016/j.comgeo.2014.10.008openalex-snapshot
Saturated simple and k-simple topological graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2015.10.028openalex-snapshot
Weak saturation number for multiple copies of the complete graph with a star removed
inferred← citeshttps://doi.org/10.1016/j.dam.2019.01.009openalex-snapshot
Extremal problems on saturation for the family of k -edge-connected graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2022.10.001openalex-snapshot
Saturation numbers for tPk with k less than 6
inferred← citeshttps://doi.org/10.1016/j.dam.2022.12.012openalex-snapshot
Minimum tP3 -saturation graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2024.01.017openalex-snapshot
A note on the minimum size of matching-saturated graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2024.06.024openalex-snapshot
Saturation numbers of joins of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.04.038openalex-snapshot
Some results on the saturation number of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.10.012openalex-snapshot
The saturation number of wheels
inferred← citeshttps://doi.org/10.1016/j.disc.2013.12.024openalex-snapshot
Ramsey-minimal saturation numbers for matchings
inferred← citeshttps://doi.org/10.1016/j.disc.2014.01.007openalex-snapshot
A note on the saturation number of the family of k -connected graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2014.07.012openalex-snapshot
Weak saturation numbers for multiple copies
inferred← citeshttps://doi.org/10.1016/j.disc.2017.06.010openalex-snapshot
The saturation number of induced subposets of the Boolean lattice
inferred← citeshttps://doi.org/10.1016/j.disc.2017.09.026openalex-snapshot
Star saturation number of random graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2019.01.006openalex-snapshot
Induced saturation of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2020.112068openalex-snapshot
The minimum spectral radius of K r + 1 -saturated graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112565openalex-snapshot
Minimizing the number of edges in C ≥ r -saturated graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112659openalex-snapshot
Regular saturated graphs and sum-free sets
inferred← citeshttps://doi.org/10.1016/j.disc.2022.112867openalex-snapshot
A lower bound on the saturation number, and graphs for which it is sharp
inferred← citeshttps://doi.org/10.1016/j.disc.2022.112921openalex-snapshot
Saturation problems with regularity constraints
inferred← citeshttps://doi.org/10.1016/j.disc.2022.113231openalex-snapshot
A sharp lower bound for the spectral radius in K4-saturated graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113504openalex-snapshot
Saturation for the 3-uniform loose 3-cycle
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113794openalex-snapshot
The saturation number of K3,3
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113868openalex-snapshot
Some results on the saturation number for unions of cliques
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114078openalex-snapshot
The weak saturation number of K2,t
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114110openalex-snapshot
The minimum spectral radius for K+1-saturated graphs with r = 4,5
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114409openalex-snapshot
Minimizing the number of edges in (C4,K1,)-co-critical graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114418openalex-snapshot
On the saturation spectrum of the unions of disjoint cycles
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114504openalex-snapshot
The saturation number of C6
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114530openalex-snapshot
Minimum saturated graphs for unions of cliques
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114532openalex-snapshot
The saturation number for unions of four cliques
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114561openalex-snapshot
Saturation numbers of bipartite graphs in random graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114690openalex-snapshot
Minimum saturated graphs without 4-cycles and 5-cycles
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114802openalex-snapshot
Partite saturation number of cycles
inferred← citeshttps://doi.org/10.1016/j.ejc.2019.02.002openalex-snapshot
Linearity of saturation for Berge hypergraphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2020.103185openalex-snapshot
Minimizing the numbers of cliques and cycles of fixed size in an F -saturated graph
inferred← citeshttps://doi.org/10.1016/j.ejc.2020.103204openalex-snapshot
On induced saturation for paths
inferred← citeshttps://doi.org/10.1016/j.ejc.2021.103477openalex-snapshot
On saturation of Berge hypergraphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2022.103533openalex-snapshot
On the size of (Kt,K1,k)-co-critical graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103702openalex-snapshot
Saturation problems in convex geometric hypergraphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103911openalex-snapshot
Saturation numbers for Berge cliques
inferred← citeshttps://doi.org/10.1016/j.endm.2011.09.082openalex-snapshot
Minimum Ck -saturated graphs
inferred← citeshttps://doi.org/10.1016/j.jcta.2020.105357openalex-snapshot
Weak saturation numbers of complete bipartite graphs in the clique
inferred← citeshttps://doi.org/10.1016/j.jctb.2022.11.003openalex-snapshot
The minimum number of clique-saturating edges
inferred← citeshttps://doi.org/10.1090/proc/16197openalex-snapshot
Weakly saturated hypergraphs and a conjecture of Tuza
inferred← citeshttps://doi.org/10.17863/cam.32787openalex-snapshot
Extremal and Structural Problems of Graphs
inferred← citeshttps://doi.org/10.20429/tag.2017.030201openalex-snapshot
Induced Subgraph Saturated Graphs
inferred← citeshttps://doi.org/10.20429/tag.2020.070102openalex-snapshot
Triangles in Ks-saturated graphs with minimum degree t
inferred← citeshttps://doi.org/10.2298/fil2517865copenalex-snapshot
Saturation numbers for linear forests
inferred← citeshttps://doi.org/10.37236/10116openalex-snapshot
Saturation Number of $tK_{l,l,l}$ in the Complete Tripartite Graph
inferred← citeshttps://doi.org/10.37236/12718openalex-snapshot
$K_r$-Saturated Graphs and the Two Families Theorem
inferred← citeshttps://doi.org/10.37236/5095openalex-snapshot
Graphs with Induced-Saturation Number Zero
inferred← citeshttps://doi.org/10.37236/8857openalex-snapshot
On the Size of $(K_t,\mathcal{T}_k)$-Co-Critical Graphs
inferred← citeshttps://doi.org/10.37236/8864openalex-snapshot
The $Q_2$-Free Process in the Hypercube
inferred← citeshttps://doi.org/10.37236/9302openalex-snapshot
Saturation Number of Berge Stars in Random Hypergraphs
inferred← citeshttps://doi.org/10.37236/9579openalex-snapshot
$P_{n}$-Induced-Saturated Graphs Exist for all $n \geqslant 6$
inferred← citeshttps://doi.org/10.37236/9851openalex-snapshot
Guessing Numbers and Extremal Graph Theory
inferred← citeshttps://doi.org/10.4310/joc.2016.v7.n1.a1openalex-snapshot
Graph saturation in multipartite graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1012.4152openalex-snapshot
Minimum K_2,3-saturated Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1402.5646openalex-snapshot
On Saturated $k$-Sperner Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1408.3204openalex-snapshot
Degree Monotone Paths and Graph Operations
inferred← citeshttps://doi.org/10.48550/arxiv.1408.5927openalex-snapshot
Saturation numbers in tripartite graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1503.01386openalex-snapshot
Saturated simple and 2-simple topological graphs with few edges
inferred← citeshttps://doi.org/10.48550/arxiv.1606.09099openalex-snapshot
Colorability Saturation Games
inferred← citeshttps://doi.org/10.48550/arxiv.1708.01054openalex-snapshot
The random k-matching-free process
inferred← citeshttps://doi.org/10.48550/arxiv.1710.07432openalex-snapshot
Extremal problems on saturation for the family of $k$-edge-connected graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1807.06947openalex-snapshot
Linearity of Saturation for Berge Hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1810.00939openalex-snapshot
Few $T$ copies in $H$-saturated graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1810.05772openalex-snapshot
$C_{2k}$-saturated graphs with no short odd cycles
inferred← citeshttps://doi.org/10.48550/arxiv.1810.12734openalex-snapshot
A note on saturation for Berge-G hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1906.02154openalex-snapshot
Triangles in $K_s$-saturated graphs with minimum degree $t$
inferred← citeshttps://doi.org/10.48550/arxiv.2002.09882openalex-snapshot
Minimizing the number of edges in $\mathcal{C}_{\ge r}$-saturated graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2005.05033openalex-snapshot
$P_{n}$-induced-saturated graphs exist for all $n \geq 6$
inferred← citeshttps://doi.org/10.48550/arxiv.2006.04355openalex-snapshot
$K_{r+1}$-saturated graphs with small spectral radius
inferred← citeshttps://doi.org/10.48550/arxiv.2101.00507openalex-snapshot
Minimizing the number of complete bipartite graphs in a $K_s$-saturated graph
inferred← citeshttps://doi.org/10.48550/arxiv.2101.04213openalex-snapshot
Generalized saturation problems for cliques, paths, and stars
inferred← citeshttps://doi.org/10.48550/arxiv.2108.13406openalex-snapshot
Generalized sum-free sets and cycle saturated regular graphs
inferred← citeshttps://doi.org/10.5070/c63362792openalex-snapshot
The induced saturation problem for posets
inferred← citeshttps://doi.org/10.61091/jcmcc123-42openalex-snapshot
Saturation of \(K_{4}\) Subdivisions in Multidimensional Grids
inferred← citeshttps://doi.org/10.7151/dmgt.1817openalex-snapshot
The saturation number for the length of degree monotone paths
inferred← citeshttps://doi.org/10.7151/dmgt.2402openalex-snapshot
Minimizing the number of complete bipartite graphs in a Ks-saturated graph
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.