On the public citation graph
An Extremal Theorem in the Hypercube
0 signed · 47 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.1002/jgt.20181openalex-snapshot
A Ramsey-type result for the hypercube
inferredcites →https://doi.org/10.1002/jgt.3190160311openalex-snapshot
Subgraphs of a hypercube containing no small even cycles
inferredcites →https://doi.org/10.1002/jgt.3190170405openalex-snapshot
Hexagon‐free subgraphs of hypercubes
inferredcites →https://doi.org/10.1002/jgt.3190190104openalex-snapshot
On the maximum number of edges in a c4‐free subgraph of qn
inferredcites →https://doi.org/10.1007/bf02759942openalex-snapshot
On extremal problems of graphs and generalized graphs
inferredcites →https://doi.org/10.1016/0095-8956(74)90052-5openalex-snapshot
Cycles of even length in graphs
inferredcites →https://doi.org/10.1016/j.disc.2006.05.008openalex-snapshot
A note on short cycles in a hypercube
inferredcites →https://doi.org/10.1016/j.disc.2008.02.015openalex-snapshot
Bounding the size of square-free subgraphs of the hypercube
inferredcites →https://doi.org/10.1016/j.endm.2009.07.085openalex-snapshot
On even-cycle-free subgraphs of the hypercube
inferredcites →https://doi.org/10.1017/cbo9780511983917.039openalex-snapshot
Some of my favourite unsolved problems
inferredcites →https://doi.org/10.1017/s0963548309009985openalex-snapshot
On 14-Cycle-Free Subgraphs of the Hypercube
inferredcites →https://doi.org/10.1023/a:1022472513494openalex-snapshot
Highly Symmetric Subgraphs of Hypercubes
inferredcites →https://doi.org/10.4064/cm-13-2-251-254openalex-snapshot
On an extremal problem in graph theory
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.23217openalex-snapshot
C10 Has Positive Turán Density in the Hypercube
inferred← citeshttps://doi.org/10.1007/978-3-319-24298-9_4openalex-snapshot
Extremal problems for cycles in graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-39286-3_7openalex-snapshot
The History of Degenerate (Bipartite) Extremal Graph Problems
inferred← citeshttps://doi.org/10.1007/978-88-7642-475-5_94openalex-snapshot
On a covering problem in the hypercube
inferred← citeshttps://doi.org/10.1007/s00026-024-00705-2openalex-snapshot
On Graphs Embeddable in a Layer of a Hypercube and Their Extremal Numbers
inferred← citeshttps://doi.org/10.1007/s00373-013-1379-8openalex-snapshot
On a Covering Problem in the Hypercube
inferred← citeshttps://doi.org/10.1007/s00373-021-02388-5openalex-snapshot
Triangle-Free Subgraphs of Hypergraphs
inferred← citeshttps://doi.org/10.1016/j.amc.2020.125763openalex-snapshot
On even-cycle-free subgraphs of the doubled Johnson graphs
inferred← citeshttps://doi.org/10.1016/j.amc.2021.126223openalex-snapshot
Extremal even-cycle-free subgraphs of the complete transposition graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2022.01.015openalex-snapshot
The vertex Turán density in 3-ary n-cubes
inferred← citeshttps://doi.org/10.1016/j.dam.2023.07.021openalex-snapshot
Extremal numbers for cycles in a hypercube
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112585openalex-snapshot
Maximum density of vertex-induced perfect cycles and paths in the hypercube
inferred← citeshttps://doi.org/10.1016/j.disc.2022.113238openalex-snapshot
Generalized Turán densities in the hypercube
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.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.jcta.2011.02.009openalex-snapshot
On even-cycle-free subgraphs of the hypercube
inferred← citeshttps://doi.org/10.1016/j.jcta.2014.04.009openalex-snapshot
On crown-free families of subsets
inferred← citeshttps://doi.org/10.1017/s0963548316000122openalex-snapshot
Saturation in the Hypercube and Bootstrap Percolation
inferred← citeshttps://doi.org/10.1017/s0963548324000063openalex-snapshot
A class of graphs of zero Turán density in a hypercube
inferred← citeshttps://doi.org/10.1093/imrn/rnaa396openalex-snapshot
The Extremal Number of Tight Cycles
inferred← citeshttps://doi.org/10.1137/110832239openalex-snapshot
Vertex Ramsey Problems in the Hypercube
inferred← citeshttps://doi.org/10.1137/20m1364631openalex-snapshot
Relative Turán Problems for Uniform Hypergraphs
inferred← citeshttps://doi.org/10.19086/aic.2024.1openalex-snapshot
Robust (rainbow) subdivisions and simplicial cycle
inferred← citeshttps://doi.org/10.2478/ausm-2021-0022openalex-snapshot
Vertex Turán problems for the oriented hypercube
inferred← citeshttps://doi.org/10.33915/etd.11291openalex-snapshot
Polychromatic colorings of certain subgraphs of complete graphs and maximum densities of substructures of a hypercube
inferred← citeshttps://doi.org/10.37236/3901openalex-snapshot
Turán Problems on Non-Uniform Hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1301.1870openalex-snapshot
Turan Problems on Non-uniform Hypergraphs
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.