On the public citation graph

Probabilistic methods in graph theory

https://doi.org/10.1007/bf01874387
0 signed · 33 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/978-0-8176-4842-8_19openalex-snapshot
Graph Theory and Probability
inferredcites →https://doi.org/10.1007/978-1-4612-0865-5_26openalex-snapshot
Probability Inequalities for sums of Bounded Random Variables
inferredcites →https://doi.org/10.1007/978-3-0348-9078-6_132openalex-snapshot
Probabilistic Methods in Combinatorics
inferredcites →https://doi.org/10.1007/bf01894680openalex-snapshot
On chromatic number of finite set-systems
inferredcites →https://doi.org/10.1007/bf02579269openalex-snapshot
On the conjecture of hajós
inferredcites →https://doi.org/10.1007/bf02579457openalex-snapshot
Intersection theorems with geometric consequences
inferredcites →https://doi.org/10.1016/0012-365x(79)90084-0openalex-snapshot
The tail of the hypergeometric distribution
inferredcites →https://doi.org/10.1016/0095-8956(79)90062-5openalex-snapshot
Hajós' graph-coloring conjecture: Variations and counterexamples
inferredcites →https://doi.org/10.1080/01621459.1963.10500830openalex-snapshot
Probability Inequalities for Sums of Bounded Random Variables
inferredcites →https://doi.org/10.1090/s0002-9904-1947-08785-1openalex-snapshot
Some remarks on the theory of graphs
inferredcites →https://doi.org/10.1112/jlms/s1-27.1.85openalex-snapshot
A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
inferredcites →https://doi.org/10.1112/s0025579300003260openalex-snapshot
On circuits and subgraphs of chromatic graphs
inferredcites →https://doi.org/10.2307/2307489openalex-snapshot
4526
inferredcites →https://doi.org/10.4153/cjm-1959-003-9openalex-snapshot
Graph Theory and Probability

What points at this work

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

inferred← citeshttps://doi.org/10.1002/rsa.3240020103openalex-snapshot
Almost all graphs with 1.44n edges are 3‐colorable
inferred← citeshttps://doi.org/10.1006/jcss.2002.1822openalex-snapshot
Optimal Bounds for the Predecessor Problem and Related Problems
inferred← citeshttps://doi.org/10.1007/3-540-46416-6_9openalex-snapshot
On the Reversibility of Oblivious Transfer
inferred← citeshttps://doi.org/10.1007/3-540-52921-7_61openalex-snapshot
Two probabilistic results on merging
inferred← citeshttps://doi.org/10.1007/978-3-319-30698-8_10openalex-snapshot
Experimental Evaluation of Two Approaches to Optimal Recombination for Permutation Problems
inferred← citeshttps://doi.org/10.1007/bfb0023762openalex-snapshot
The cutting plane proof system with bounded degree of falsity
inferred← citeshttps://doi.org/10.1007/bfb0092252openalex-snapshot
A form invariant multivariable polynomial representation of graphs
inferred← citeshttps://doi.org/10.1007/pl00009235openalex-snapshot
Average-Case Analysis of the Merging Algorithm of Hwang and Lin
inferred← citeshttps://doi.org/10.1016/0012-365x(78)90061-4openalex-snapshot
On Turan hypergraphs
inferred← citeshttps://doi.org/10.1063/1.4965326openalex-snapshot
Optimal recombination in genetic algorithms for flowshop scheduling problems
inferred← citeshttps://doi.org/10.1134/s1990478916020071openalex-snapshot
On complexity of optimal recombination for flowshop scheduling problems
inferred← citeshttps://doi.org/10.1137/0222019openalex-snapshot
Two Probabilistic Results on Merging
inferred← citeshttps://doi.org/10.1137/s0097539792232021openalex-snapshot
Existence and Construction of Edge-Disjoint Paths on Expander Graphs
inferred← citeshttps://doi.org/10.1145/129712.129727openalex-snapshot
Existence and construction of edge disjoint paths on expander graphs
inferred← citeshttps://doi.org/10.1145/168304.168312openalex-snapshot
On the query complexity of learning
inferred← citeshttps://doi.org/10.1145/301250.301323openalex-snapshot
Optimal bounds for the predecessor problem
inferred← citeshttps://doi.org/10.1145/48014.48016openalex-snapshot
Many hard examples for resolution
inferred← citeshttps://doi.org/10.2298/yjor161012003eopenalex-snapshot
On solving Travelling Salesman Problem with Vertex Requisitions
inferred← citeshttps://doi.org/10.5244/c.19.51openalex-snapshot
Hamiltonian path based shadow removal
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.