On the public citation graph

The Erdös-Jacobson-Lehel conjecture on potentiallyP k-graphic sequence is true

https://doi.org/10.1007/bf02879940
0 signed · 46 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/bfb0092288openalex-snapshot
A survey of the theory of potentially P-graphic and forcibly P-graphic degree sequences
inferredcites →https://doi.org/10.1016/0012-365x(73)90037-xopenalex-snapshot
Algorithms for constructing graphs and digraphs with given valences and factors
inferredcites →https://doi.org/10.1016/s0924-6509(09)x7013-3openalex-snapshot
Graphs and Hypergraphs
inferredcites →https://doi.org/10.1112/blms/6.2.218bopenalex-snapshot
GRAPHS AND HYPERGRAPHS
inferredcites →https://doi.org/10.1201/9781420010572.pt2openalex-snapshot
Combinatorial Matrix Theory
inferredcites →https://doi.org/10.1201/b16132-57openalex-snapshot
Extremal Graph Theory
inferredcites →https://doi.org/10.2140/pjm.1960.10.831openalex-snapshot
Zero-one matrices with zero trace

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11809678_24openalex-snapshot
Sequences Characterizing k-Trees
inferred← citeshttps://doi.org/10.1007/s00373-007-0737-9openalex-snapshot
Graphic Sequences with a Realization Containing a Union of Cliques
inferred← citeshttps://doi.org/10.1007/s00493-015-2986-1openalex-snapshot
On the sum necessary to ensure that a degree sequence is potentially H-graphic
inferred← citeshttps://doi.org/10.1007/s10114-005-0676-4openalex-snapshot
The Threshold for the Erdős, Jacobson and Lehel Conjecture to Be True
inferred← citeshttps://doi.org/10.1007/s10114-009-7260-2openalex-snapshot
A variation of a conjecture due to Erdös and Sós
inferred← citeshttps://doi.org/10.1007/s10114-012-9608-2openalex-snapshot
Graphic sequences with a realization containing intersecting cliques
inferred← citeshttps://doi.org/10.1007/s10255-006-0321-8openalex-snapshot
The Smallest Degree Sum That Yields Potentially K r+1 −K 3-Graphic Sequences
inferred← citeshttps://doi.org/10.1007/s10255-016-0622-5openalex-snapshot
Graphic sequences and split graphs
inferred← citeshttps://doi.org/10.1007/s10255-024-1055-1openalex-snapshot
A Potential Degree Sequence Problem of the Loebl-Komlós-Sós Conjecture
inferred← citeshttps://doi.org/10.1007/s10587-007-0108-yopenalex-snapshot
On potentially H-graphic sequences
inferred← citeshttps://doi.org/10.1007/s10587-009-0012-8openalex-snapshot
On potentially K 5-H-graphic sequences
inferred← citeshttps://doi.org/10.1007/s10587-009-0074-7openalex-snapshot
Potentially K m — G-graphical sequences: A survey
inferred← citeshttps://doi.org/10.1007/s11425-010-3124-6openalex-snapshot
A characterization for a graphic sequence to be potentially C r -graphic
inferred← citeshttps://doi.org/10.1016/j.dam.2023.05.007openalex-snapshot
Solution to a general version of a degree sequence variant of the Erdős–Sós conjecture
inferred← citeshttps://doi.org/10.1016/j.dam.2024.11.027openalex-snapshot
On the potential function σ(H,m,n) of an arbitrary bipartite graph H
inferred← citeshttps://doi.org/10.1016/j.disc.2005.03.028openalex-snapshot
Two sufficient conditions for a graphic sequence to have a realization with prescribed clique size
inferred← citeshttps://doi.org/10.1016/j.disc.2007.10.047openalex-snapshot
Graphic sequences with a realization containing a complete multipartite subgraph
inferred← citeshttps://doi.org/10.1016/j.disc.2007.11.075openalex-snapshot
Graphic sequences with a realization containing a generalized friendship graph
inferred← citeshttps://doi.org/10.1016/j.disc.2008.04.057openalex-snapshot
A generalization of a conjecture due to Erdős, Jacobson and Lehel
inferred← citeshttps://doi.org/10.1016/j.disc.2009.06.014openalex-snapshot
Conditions for r -graphic sequences to be potentially Km+1(r) -graphic
inferred← citeshttps://doi.org/10.1016/j.disc.2011.12.016openalex-snapshot
A Gale–Ryser type characterization of potentially Ks,t -bigraphic pairs
inferred← citeshttps://doi.org/10.1016/j.ejc.2003.12.011openalex-snapshot
A variation of a classical Turán-type extremal problem
inferred← citeshttps://doi.org/10.1016/j.ejc.2019.103061openalex-snapshot
On the potential function of an arbitrary graph H
inferred← citeshttps://doi.org/10.1016/j.endm.2007.01.018openalex-snapshot
An Erdős-Stone Type Conjecture for Graphic Sequences
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00765-3openalex-snapshot
An extremal problem on potentially Kr,s-graphic sequences
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00137-7openalex-snapshot
The smallest degree sum that yields potentially kCℓ-graphic sequences
inferred← citeshttps://doi.org/10.1080/09720529.2018.1555079openalex-snapshot
A sufficient condition for r - graphic sequences to be potentially
inferred← citeshttps://doi.org/10.1137/080715275openalex-snapshot
A General Lower Bound for Potentially H -Graphic Sequences
inferred← citeshttps://doi.org/10.1137/16m1109643openalex-snapshot
Stability of the Potential Function
inferred← citeshttps://doi.org/10.1360/02ys9076openalex-snapshot
The smallest degree sum that yields potentially Kr,r-graphic sequences
inferred← citeshttps://doi.org/10.1515/ausi-2017-0003openalex-snapshot
On multigraphic and potentially multigraphic sequences
inferred← citeshttps://doi.org/10.4208/ata.2018.v34.n2.8openalex-snapshot
On Potentially Graphical Sequences of $G−E(H)$
inferred← citeshttps://doi.org/10.46298/dmtcs.357openalex-snapshot
An extremal problem on potentially K_p,1,1-graphic sequences
inferred← citeshttps://doi.org/10.48550/arxiv.0710.0409openalex-snapshot
On potentially $K_{r+1}-U$-graphical Sequences
inferred← citeshttps://doi.org/10.48550/arxiv.0801.0658openalex-snapshot
On Potentially 3-regular graph graphic Sequences
inferred← citeshttps://doi.org/10.48550/arxiv.math/0206048openalex-snapshot
The smallest degree sum that yields potentially $C_k$-graphical sequence
inferred← citeshttps://doi.org/10.48550/arxiv.math/0603602openalex-snapshot
An Extremal Problem On Potentially $K_{r+1}-(kP_2\bigcup tK_2)$-graphic Sequences
inferred← citeshttps://doi.org/10.48550/arxiv.math/0608245openalex-snapshot
The smallest degree sum that yields potentially K_{r+1}-Z-graphical Sequences
inferred← citeshttps://doi.org/10.7151/dmgt.1466openalex-snapshot
Potentially H-bigraphic sequences
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.