On the public citation graph
An extremal problem in graph theory
0 signed · 55 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.2307/1911908openalex-snapshot
The Theory of Graphs and Its Applications
inferredcites →https://doi.org/10.2307/2333777openalex-snapshot
The Theory of Graphs and its Applications.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4806789openalex-extracted
An Improved Upper Bound for Planar Turan Number Of S2,5
inferred← citeshttps://doi.org/10.1002/jgt.20143openalex-snapshot
On connectivity in graphs with given clique number
inferred← citeshttps://doi.org/10.1002/jgt.20419openalex-snapshot
On local connectivity of graphs with given clique number
inferred← citeshttps://doi.org/10.1002/jgt.21850openalex-snapshot
A Brooks‐Type Theorem for the Bichromatic Number
inferred← citeshttps://doi.org/10.1002/net.20173openalex-snapshot
Sufficient conditions for graphs to be lambda '-optimal and super-lambda '
inferred← citeshttps://doi.org/10.1002/rsa.10035openalex-snapshot
A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems
inferred← citeshttps://doi.org/10.1002/rsa.20953openalex-snapshot
Short proofs of some extremal results III
inferred← citeshttps://doi.org/10.1002/rsa.20994openalex-snapshot
Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth
inferred← citeshttps://doi.org/10.1002/rsa.21193openalex-snapshot
Coloring lines and Delaunay graphs with respect to boxes
inferred← citeshttps://doi.org/10.1007/978-3-642-32278-5_8openalex-snapshot
Connectivity and Depth First Search
inferred← citeshttps://doi.org/10.1007/bf01896438openalex-snapshot
The number of cut vertices and cut arcs in a strong directed graph
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90145-8openalex-snapshot
The number of cutvertices in graphs with given minimum degree
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90402-nopenalex-snapshot
The number of cut-vertices in a graph of given minimum degree
inferred← citeshttps://doi.org/10.1016/j.amc.2024.128814openalex-snapshot
Turán problem for K4− -free signed graphs
inferred← citeshttps://doi.org/10.1016/j.amc.2024.128981openalex-snapshot
The conflict-free connection number and the minimum degree-sum of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2006.01.005openalex-snapshot
The complexity of detecting fixed-density clusters
inferred← citeshttps://doi.org/10.1016/j.dam.2015.06.037openalex-snapshot
An extension of the Motzkin–Straus theorem to non-uniform hypergraphs and its applications
inferred← citeshttps://doi.org/10.1016/j.dam.2022.04.007openalex-snapshot
The Turán number of the triangular pyramid of 3-layers
inferred← citeshttps://doi.org/10.1016/j.disc.2010.07.002openalex-snapshot
An analytic approach to stability
inferred← citeshttps://doi.org/10.1016/j.disc.2012.01.013openalex-snapshot
Degree condition and Z3 -connectivity
inferred← citeshttps://doi.org/10.1016/j.disc.2012.09.015openalex-snapshot
Combinatorial bounds on nonnegative rank and extended formulations
inferred← citeshttps://doi.org/10.1016/j.disc.2013.12.013openalex-snapshot
On the k -residue of disjoint unions of graphs with applications to k -independence
inferred← citeshttps://doi.org/10.1016/j.disc.2016.05.031openalex-snapshot
Strong subtournaments and cycles of multipartite tournaments
inferred← citeshttps://doi.org/10.1016/j.disc.2017.01.010openalex-snapshot
Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded
inferred← citeshttps://doi.org/10.1016/j.disc.2020.111964openalex-snapshot
On the independence number of non-uniform uncrowded hypergraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114149openalex-snapshot
Generalized Turán results for edge blow-up of star forests
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114151openalex-snapshot
Spectral extrema of graphs with fixed size: Forbidden triangles and pentagons
inferred← citeshttps://doi.org/10.1016/j.disopt.2023.100802openalex-snapshot
Constructing extremal triangle-free graphs using integer programming
inferred← citeshttps://doi.org/10.1016/j.ejc.2022.103576openalex-snapshot
Graphs with large maximum degree containing no edge-critical graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2017.07.023openalex-snapshot
Supersaturation Problem for the Bowtie
inferred← citeshttps://doi.org/10.1016/j.jcta.2019.05.014openalex-snapshot
Colouring set families without monochromatic k-chains
inferred← citeshttps://doi.org/10.1016/s0095-8956(81)80016-0openalex-snapshot
Dense neighbourhoods and Turán's theorem
inferred← citeshttps://doi.org/10.1017/s0963548321000110openalex-snapshot
Universal and unavoidable graphs
inferred← citeshttps://doi.org/10.1109/csci54926.2021.00035openalex-snapshot
An Experimental Evaluation of a Function in Extremal Combinatorics
inferred← citeshttps://doi.org/10.1109/infocom.2017.8056956openalex-snapshot
Motif clustering and overlapping clustering for social network analysis
inferred← citeshttps://doi.org/10.1155/2021/6691960openalex-snapshot
The Number of Blocks of a Graph with Given Minimum Degree
inferred← citeshttps://doi.org/10.37236/10068openalex-snapshot
Turán Density of $2$-Edge-Colored Bipartite Graphs with Application on $\{2, 3\}$-Hypergraphs
inferred← citeshttps://doi.org/10.37236/11236openalex-snapshot
The Maximum Spectral Radius of Non-Bipartite Graphs Forbidding Short Odd Cycles
inferred← citeshttps://doi.org/10.46298/dmtcs.1367openalex-snapshot
Ramsey-type theorems for lines in 3-space
inferred← citeshttps://doi.org/10.46298/dmtcs.2118openalex-snapshot
An approximability-related parameter on graphs―-properties and applications
inferred← citeshttps://doi.org/10.46298/dmtcs.3437openalex-snapshot
Chromatic Turán problems and a new upper bound for the Turán density of $\mathcal{K}_4^-$
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.46298/dmtcs.628openalex-snapshot
The Erdős-Sós conjecture for geometric graphs
inferred← citeshttps://doi.org/10.46298/dmtcs.646openalex-snapshot
The Flip Diameter of Rectangulations and Convex Subdivisions
inferred← citeshttps://doi.org/10.7151/dmgt.1686openalex-snapshot
Bounds on the signed 2-independence number in graphs
inferred← citeshttps://doi.org/10.7151/dmgt.1724openalex-snapshot
The numbers of cut-vertices and end-blocks in 4-regular graphs
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.