On the public citation graph

Some problems in graph theory

https://doi.org/10.1007/bfb0066194
0 signed · 53 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.1002/net.3230010407openalex-snapshot
Imbalances in k‐colorations
inferredcites →https://doi.org/10.1016/0012-365x(72)90079-9openalex-snapshot
A note on Hamiltonian circuits
inferredcites →https://doi.org/10.1016/s0095-8956(73)80005-xopenalex-snapshot
Ramsey numbers for cycles in 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/(sici)1097-0118(199705)25:1<3::aid-jgt1>3.3.co;2-vopenalex-snapshot
Open problems of Paul Erdos in graph theory
inferred← citeshttps://doi.org/10.1002/jgt.22553openalex-snapshot
Low independence number and Hamiltonicity implies pancyclicity
inferred← citeshttps://doi.org/10.1002/jgt.22723openalex-snapshot
Triangles in C5‐free graphs and hypergraphs of girth six
inferred← citeshttps://doi.org/10.1002/jgt.3190010109openalex-snapshot
Some recent results in hamiltonian graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190060207openalex-snapshot
On digraphs without antidirected cycles
inferred← citeshttps://doi.org/10.1002/rsa.20344openalex-snapshot
Dependent random choice
inferred← citeshttps://doi.org/10.1002/rsa.v35:1openalex-snapshot
inferred← citeshttps://doi.org/10.1006/inco.1993.1010openalex-snapshot
Subcube Fault-Tolerance in Hypercubes
inferred← citeshttps://doi.org/10.1007/978-3-319-24298-9_5openalex-snapshot
A survey of Turán problems for expansions
inferred← citeshttps://doi.org/10.1007/978-3-319-97686-0_9openalex-snapshot
Some of My Favourite Conjectures: Local Conditions Implying Global Cycle Properties
inferred← citeshttps://doi.org/10.1007/bfb0102685openalex-snapshot
Interlaced trees: A class of graceful trees
inferred← citeshttps://doi.org/10.1007/s00373-017-1767-6openalex-snapshot
A Variation of the Erdős–Sós Conjecture in Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/s00493-012-2710-3openalex-snapshot
On two problems in graph Ramsey theory
inferred← citeshttps://doi.org/10.1016/0012-365x(88)90122-7openalex-snapshot
Graph decomposition with constraints on the minimum degree
inferred← citeshttps://doi.org/10.1016/j.aim.2008.07.009openalex-snapshot
Induced Ramsey-type theorems
inferred← citeshttps://doi.org/10.1016/j.aim.2011.02.004openalex-snapshot
A conjecture of Erdős on graph Ramsey numbers
inferred← citeshttps://doi.org/10.1016/j.disc.2008.07.025openalex-snapshot
Some Turán type results on the hypercube
inferred← citeshttps://doi.org/10.1016/j.disc.2013.01.011openalex-snapshot
Oriented trees in digraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113576openalex-snapshot
Pairing strategies for the Maker–Breaker game on the hypercube with subcubes as winning sets
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.11.002openalex-snapshot
Hamiltonicity, independence number, and pancyclicity
inferred← citeshttps://doi.org/10.1016/j.ejc.2013.06.003openalex-snapshot
Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
inferred← citeshttps://doi.org/10.1016/j.ejc.2019.103001openalex-snapshot
Counting copies of a fixed subgraph in F -free graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2017.06.065openalex-snapshot
A note on the maximum number of triangles in a C5-free graph
inferred← citeshttps://doi.org/10.1016/j.jctb.2010.02.001openalex-snapshot
Pancyclicity of Hamiltonian and highly connected graphs
inferred← citeshttps://doi.org/10.1017/cbo9781139004114.004openalex-snapshot
Hypergraph Turán problems
inferred← citeshttps://doi.org/10.1017/s0963548309009985openalex-snapshot
On 14-Cycle-Free Subgraphs of the Hypercube
inferred← citeshttps://doi.org/10.1080/03081087.2019.1628911openalex-snapshot
The spectral radius of graphs without trees of diameter at most four
inferred← citeshttps://doi.org/10.1080/09728600.2006.12088808openalex-snapshot
A survey on graphs which have equal domination and closed neighborhood packing numbers
inferred← citeshttps://doi.org/10.1112/blms/14.3.177openalex-snapshot
A Glance at Graph Theory-Part I
inferred← citeshttps://doi.org/10.1137/060649422openalex-snapshot
Turán’s Theorem in the Hypercube
inferred← citeshttps://doi.org/10.1137/060667360openalex-snapshot
Ramsey Numbers and the Size of Graphs
inferred← citeshttps://doi.org/10.1137/16m109898xopenalex-snapshot
On the Number of Cycles in a Graph with Restricted Cycle Lengths
inferred← citeshttps://doi.org/10.1137/22m1543318openalex-snapshot
Extremal Problems for Hypergraph Blowups of Trees
inferred← citeshttps://doi.org/10.1142/9789814324359_0159openalex-snapshot
Recent Developments in Extremal Combinatorics: Ramsey and Turán Type Problems
inferred← citeshttps://doi.org/10.1285/i15900932v29n1supplp135openalex-snapshot
On the number of $k$-gons in finite projective planes
inferred← citeshttps://doi.org/10.26493/1855-3974.905.cb4openalex-snapshot
On the Erdős-Sós Conjecture for graphs on n = k + 4 vertices
inferred← citeshttps://doi.org/10.37236/21openalex-snapshot
Small Ramsey Numbers
inferred← citeshttps://doi.org/10.37236/2733openalex-snapshot
Turán $H$-Densities for 3-Graphs
inferred← citeshttps://doi.org/10.37236/383openalex-snapshot
An Extremal Theorem in the Hypercube
inferred← citeshttps://doi.org/10.37236/586openalex-snapshot
Embedding a Forest in a Graph
inferred← citeshttps://doi.org/10.37236/6521openalex-snapshot
Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic Number
inferred← citeshttps://doi.org/10.37236/867openalex-snapshot
An Extremal Characterization of Projective Planes
inferred← citeshttps://doi.org/10.4064/dm454-0-1openalex-snapshot
Cycles in graphs and related problems
inferred← citeshttps://doi.org/10.48550/arxiv.1403.5430openalex-snapshot
On the Erdos-Sos Conjecture for Graphs on n=k+4 Vertices
inferred← citeshttps://doi.org/10.48550/arxiv.1607.08152openalex-snapshot
Multicolour containers and the entropy of decorated graph limits
inferred← citeshttps://doi.org/10.48550/arxiv.1910.09208openalex-snapshot
An efficient container lemma
inferred← citeshttps://doi.org/10.48550/arxiv.2103.12255openalex-snapshot
On the number of $k$-gons in finite projective planes
inferred← citeshttps://doi.org/10.56994/jamr.002.001.001openalex-snapshot
Chvátal-Erdo s condition for pancyclicity
inferred← citeshttps://doi.org/10.5817/cz.muni.eurocomb23-052openalex-snapshot
Chvátal-Erdős condition for pancyclicity
inferred← citeshttps://doi.org/10.7151/dmgt.1324openalex-snapshot
Chvátal-Erdös condition and pancyclism
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.