On the public citation graph

The Independence Ratio of Regular Graphs

0 signed · 60 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 points at this work

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

inferred← citeshttps://doi.org/10.1002/jgt.20194openalex-snapshot
Independent sets in tensor graph powers
inferred← citeshttps://doi.org/10.1002/jgt.3190100108openalex-snapshot
Bipartite density and the independence ratio
inferred← citeshttps://doi.org/10.1002/rsa.20072openalex-snapshot
Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method
inferred← citeshttps://doi.org/10.1002/rsa.20308openalex-snapshot
Parameter testing in bounded degree graphs of subexponential growth
inferred← citeshttps://doi.org/10.1002/rsa.20547openalex-snapshot
Invariant Gaussian processes and independent sets on regular graphs of large girth
inferred← citeshttps://doi.org/10.1002/rsa.20716openalex-snapshot
The Greedy Independent Set in a Random Graph with Given Degrees
inferred← citeshttps://doi.org/10.1002/rsa.20769openalex-snapshot
On large‐girth regular graphs and random processes on trees
inferred← citeshttps://doi.org/10.1002/rsa.3240010406openalex-snapshot
Randomized broadcast in networks
inferred← citeshttps://doi.org/10.1002/rsa.70012openalex-snapshot
Coloring Graphs With Forbidden Almost Bipartite Subgraphs
inferred← citeshttps://doi.org/10.1006/jctb.2001.2043openalex-snapshot
Graph Imperfection II
inferred← citeshttps://doi.org/10.1007/978-1-4614-7258-2_22openalex-snapshot
On Some Hypergraph Problems of Paul Erdős and the Asymptotics of Matchings, Covers and Colorings
inferred← citeshttps://doi.org/10.1007/978-3-540-27821-4_32openalex-snapshot
Maximum Weight Independent Sets and Matchings in Sparse Random Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-69395-6_1openalex-snapshot
Random Graphs and Branching Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-76796-1_8openalex-snapshot
Locally Dense Independent Sets in Regular Graphs of Large Girth—An Example of a New Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-31104-8_5openalex-snapshot
Deterministic Local Algorithms, Unique Identifiers, and Fractional Graph Colouring
inferred← citeshttps://doi.org/10.1007/978-3-642-60408-9_26openalex-snapshot
On Some Hypergraph Problems of Paul Erdős and the Asymptotics of Matchings, Covers and Colorings
inferred← citeshttps://doi.org/10.1007/s00373-015-1628-0openalex-snapshot
Percolation with Small Clusters on Random Graphs
inferred← citeshttps://doi.org/10.1007/s00373-018-1999-0openalex-snapshot
Polynomial $$\chi $$ χ -Binding Functions and Forbidden Induced Subgraphs: A Survey
inferred← citeshttps://doi.org/10.1007/s00440-022-01165-6openalex-snapshot
A tale of two balloons
inferred← citeshttps://doi.org/10.1007/s00493-023-00051-6openalex-snapshot
A Factor Matching of Optimal Tail Between Poisson Processes
inferred← citeshttps://doi.org/10.1007/s10955-022-03062-7openalex-snapshot
Improved Replica Bounds for the Independence Ratio of Random Regular Graphs
inferred← citeshttps://doi.org/10.1007/s11511-017-0145-9openalex-snapshot
Maximum independent sets on random regular graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(84)90115-8openalex-snapshot
Induced forests in cubic graphs
inferred← citeshttps://doi.org/10.1016/j.akcej.2019.08.001openalex-snapshot
Independent point-set dominating sets in graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2018.09.030openalex-snapshot
On the chromatic number of 2K2 -free graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2020.12.013openalex-snapshot
A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees
inferred← citeshttps://doi.org/10.1016/j.dam.2022.05.014openalex-snapshot
Homogeneous sets, clique-separators, critical graphs, and optimal χ -binding functions
inferred← citeshttps://doi.org/10.1016/j.disc.2017.09.014openalex-snapshot
Packing chromatic number of cubic graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2020.103284openalex-snapshot
Tilings in graphons
inferred← citeshttps://doi.org/10.1016/j.ejc.2021.103355openalex-snapshot
Injective edge-coloring of graphs with given maximum degree
inferred← citeshttps://doi.org/10.1016/j.jctb.2007.02.006openalex-snapshot
Large independent sets in regular graphs of large girth
inferred← citeshttps://doi.org/10.1016/j.jctb.2024.07.002openalex-snapshot
Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
inferred← citeshttps://doi.org/10.1016/j.spa.2020.09.009openalex-snapshot
Asymptotic optimality of degree-greedy discovering of independent sets in Configuration Model graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.06.044openalex-snapshot
Deterministic local algorithms, unique identifiers, and fractional graph colouring
inferred← citeshttps://doi.org/10.1016/s0195-6698(13)80042-xopenalex-snapshot
Asymptotic Enumeration by Degree Sequence of Graphs of High Degree
inferred← citeshttps://doi.org/10.1017/etds.2018.3openalex-snapshot
Mutual information decay for factors of i.i.d.
inferred← citeshttps://doi.org/10.1017/etds.2022.14openalex-snapshot
A factor of i.i.d. with uniform marginals and infinite clusters spanned by equal labels
inferred← citeshttps://doi.org/10.1017/fmp.2024.8openalex-snapshot
ON HOMOMORPHISM GRAPHS
inferred← citeshttps://doi.org/10.1017/fms.2025.10112openalex-snapshot
Random independent sets in triangle-free graphs
inferred← citeshttps://doi.org/10.1017/s0143385711000654openalex-snapshot
Dynamical properties of profinite actions
inferred← citeshttps://doi.org/10.1017/s0963548311000733openalex-snapshot
Approximating Cayley Diagrams Versus Cayley Graphs
inferred← citeshttps://doi.org/10.1017/s0963548322000104openalex-snapshot
Colouring graphs with forbidden bipartite subgraphs
inferred← citeshttps://doi.org/10.1080/09728600.2025.2488229openalex-snapshot
Independent 2-point set domination in graphs with specified girth
inferred← citeshttps://doi.org/10.1090/s0002-9939-10-10291-3openalex-snapshot
Borel oracles. An analytical approach to constant-time algorithms
inferred← citeshttps://doi.org/10.1090/s0894-0347-1994-1224593-5openalex-snapshot
On a problem of Erdős and Lovász. II. 𝑛(𝑟)=𝑂(𝑟)
inferred← citeshttps://doi.org/10.1090/tran/6464openalex-snapshot
Matchings in Benjamini–Schramm convergent graph sequences
inferred← citeshttps://doi.org/10.1109/allerton.2008.4797660openalex-snapshot
Convergence of optimal values past critical threshold
inferred← citeshttps://doi.org/10.1137/15m1021362openalex-snapshot
Factor of IID Percolation on Trees
inferred← citeshttps://doi.org/10.1137/20m1321760openalex-snapshot
Bipartite Independence Number in Graphs with Bounded Maximum Degree
inferred← citeshttps://doi.org/10.1137/20m1382283openalex-snapshot
Fractional Chromatic Number, Maximum Degree, and Girth
inferred← citeshttps://doi.org/10.1142/s0219061325500035openalex-snapshot
Ramsey, expanders, and Borel chromatic numbers
inferred← citeshttps://doi.org/10.1214/14-aop952openalex-snapshot
Independence ratio and random eigenvectors in transitive graphs
inferred← citeshttps://doi.org/10.1214/19-aihp1044openalex-snapshot
Entropy and expansion
inferred← citeshttps://doi.org/10.1214/21-aihp1233openalex-snapshot
Typicality and entropy of processes on infinite trees
inferred← citeshttps://doi.org/10.1364/optica.5.000718openalex-snapshot
Experimental test of quantum correlations from Platonic graphs
inferred← citeshttps://doi.org/10.37236/7272openalex-snapshot
Cubic Graphs with Small Independence Ratio
inferred← citeshttps://doi.org/10.4171/ggd/492openalex-snapshot
Entropy inequalities for factors of IID
inferred← citeshttps://doi.org/10.70675/53af4afcz56aaz4876zb235z21f7f302f893openalex-snapshot
Some vertex colouring problems and a generalisation of Hamilton-connectivity in graphs
inferred← citeshttps://doi.org/10.70675/cae60fe0z49d9z4c30za6f1z76158ca58aa5openalex-snapshot
Coloration de graphes épars
inferred← citeshttps://doi.org/10.70675/dd4988c9z8f33z40f5z87ffz58da82701bdfopenalex-snapshot
Some colouring problems in edge/vertex-coloured graphs : Structural and extremal studies
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.