On the public citation graph

A New Lower Bound on the Independence Number of a Graph and Applications

https://doi.org/10.37236/3601
0 signed · 21 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01191201openalex-snapshot
Small transversals in hypergraphs
inferredcites →https://doi.org/10.1007/bf02579154openalex-snapshot
Independence, clique size and maximum degree
inferredcites →https://doi.org/10.1007/s00493-007-2020-3openalex-snapshot
Total domination of graphs and small transversals of hypergraphs
inferredcites →https://doi.org/10.1016/0095-8956(79)90044-3openalex-snapshot
Matchings and transversals in hypergraphs, domination and independence-in trees
inferredcites →https://doi.org/10.1016/0095-8956(90)90101-5openalex-snapshot
An upper bound for the transversal numbers of 4-uniform hypergraphs
inferredcites →https://doi.org/10.7151/dmgt.1169openalex-snapshot
Domination in partitioned graphs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/jgt.21993openalex-snapshot
The Fano Plane and the Strong Independence Ratio in Hypergraphs of Maximum Degree 3
inferred← citeshttps://doi.org/10.1007/s40840-018-00705-5openalex-snapshot
Zero Forcing in Claw-Free Cubic Graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2014.07.001openalex-snapshot
An improved lower bound on the independence number of a graph
inferred← citeshttps://doi.org/10.1016/j.dam.2015.06.009openalex-snapshot
A lower bound on the independence number of a graph in terms of degrees and local clique sizes
inferred← citeshttps://doi.org/10.1016/j.dam.2016.09.021openalex-snapshot
Bounds on the independence number of a graph in terms of order, size and maximum degree
inferred← citeshttps://doi.org/10.1016/j.dam.2021.05.033openalex-snapshot
A new upper bound on the total domination number in graphs with minimum degree six
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113609openalex-snapshot
A note on Reed's conjecture for triangle-free graphs
inferred← citeshttps://doi.org/10.1016/j.disopt.2024.100850openalex-snapshot
The packing number of cubic graphs
inferred← citeshttps://doi.org/10.1137/22m1475508openalex-snapshot
The Tuza–Vestergaard Theorem
inferred← citeshttps://doi.org/10.1142/s1793830918500696openalex-snapshot
New bounds on the independence number of connected graphs
inferred← citeshttps://doi.org/10.1142/s1793830922501324openalex-snapshot
Some bounds on the size of maximum G-free sets in graphs
inferred← citeshttps://doi.org/10.2298/aadm1801143hopenalex-snapshot
Perfect roman domination in regular graphs
inferred← citeshttps://doi.org/10.2478/ausi-2014-0022openalex-snapshot
On vertex independence number of uniform hypergraphs
inferred← citeshttps://doi.org/10.2989/16073606.2017.1398193openalex-snapshot
Packing in regular graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2104.01092openalex-snapshot
Conjecture of TxGraffiti: Independence, domination, and matchings
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.