On the public citation graph
Expanding graphs contain all small trees
0 signed · 164 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.3190070115openalex-snapshot
On size Ramsey number of paths, trees, and circuits. I
inferredcites →https://doi.org/10.1007/978-3-642-72905-8_4openalex-snapshot
On Size Ramsey Number of Paths, Trees and Circuits. II
inferredcites →https://doi.org/10.1016/0012-365x(76)90068-6openalex-snapshot
Hamiltonian circuits in random graphs
inferredcites →https://doi.org/10.1016/0012-365x(88)90189-6openalex-snapshot
Explicit construction of linear sized tolerant networks
inferredcites →https://doi.org/10.1016/c2009-0-09109-0openalex-snapshot
Combinatorial Problems and Exercises
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/1097-0118(200103)36:3<121::aid-jgt1000>3.0.co;2-uopenalex-snapshot
Tree embeddings
inferred← citeshttps://doi.org/10.1002/jgt.22115openalex-snapshot
On the Size‐Ramsey Number of Hypergraphs
inferred← citeshttps://doi.org/10.1002/jgt.22432openalex-snapshot
The size‐Ramsey number of powers of paths
inferred← citeshttps://doi.org/10.1002/jgt.3190140408openalex-snapshot
Universal graphs and induced‐universal graphs
inferred← citeshttps://doi.org/10.1002/rsa.10081openalex-snapshot
Regular pairs in sparse random graphs I
inferred← citeshttps://doi.org/10.1002/rsa.20143openalex-snapshot
Sparse universal graphs for bounded‐degree graphs
inferred← citeshttps://doi.org/10.1002/rsa.20337openalex-snapshot
Explicit sparse almost-universal graphs for ${\bf {{\cal G}(n, {k \over n})}}$
inferred← citeshttps://doi.org/10.1002/rsa.20345openalex-snapshot
Local resilience of almost spanning trees in random graphs
inferred← citeshttps://doi.org/10.1002/rsa.20462openalex-snapshot
Finding cycles and trees in sublinear time
inferred← citeshttps://doi.org/10.1002/rsa.20472openalex-snapshot
Sharp threshold for the appearance of certain spanning trees in random graphs
inferred← citeshttps://doi.org/10.1002/rsa.20508openalex-snapshot
Long paths and cycles in random subgraphs of graphs with large minimum degree
inferred← citeshttps://doi.org/10.1002/rsa.20783openalex-snapshot
The size Ramsey number of short subdivisions of bounded degree graphs
inferred← citeshttps://doi.org/10.1002/rsa.20995openalex-snapshot
The size‐Ramsey number of short subdivisions
inferred← citeshttps://doi.org/10.1002/rsa.21036openalex-snapshot
Algebraic and combinatorial expansion in random simplicial complexes
inferred← citeshttps://doi.org/10.1002/rsa.21124openalex-snapshot
Ramsey goodness of trees in random graphs
inferred← citeshttps://doi.org/10.1002/rsa.21253openalex-snapshot
Ramsey numbers of cycles in random graphs
inferred← citeshttps://doi.org/10.1002/rsa.3240040106openalex-snapshot
The size Ramsey number of trees with bounded degree
inferred← citeshttps://doi.org/10.1002/rsa.3240060405openalex-snapshot
On an anti‐Ramsey property of Ramanujan graphs
inferred← citeshttps://doi.org/10.1002/rsa.70055openalex-snapshot
Universality for Graphs of Bounded Degeneracy
inferred← citeshttps://doi.org/10.1002/rsa.70059openalex-snapshot
Size‐Ramsey Numbers of Structurally Sparse Graphs
inferred← citeshttps://doi.org/10.1007/3-540-44666-4_20openalex-snapshot
Near-optimum Universal Graphs for Graphs with Bounded Degrees
inferred← citeshttps://doi.org/10.1007/3-540-63890-3_36openalex-snapshot
On defect sets in bipartite graphs (extended abstract)
inferred← citeshttps://doi.org/10.1007/978-3-030-55857-4_19openalex-snapshot
Tree Containment and Degree Conditions
inferred← citeshttps://doi.org/10.1007/978-3-642-14444-8_1openalex-snapshot
Universality, Tolerance, Chaos and Order
inferred← citeshttps://doi.org/10.1007/978-3-662-59204-5_14openalex-snapshot
Embedding Graphs into Larger Graphs: Results, Methods, and Problems
inferred← citeshttps://doi.org/10.1007/bf01270385openalex-snapshot
The electrical resistance of a graph captures its commute and cover times
inferred← citeshttps://doi.org/10.1007/bf01759044openalex-snapshot
A lower bound on the area of permutation layouts
inferred← citeshttps://doi.org/10.1007/bfb0040384openalex-snapshot
Graph embeddings 1988: Recent breakthroughs, new directions
inferred← citeshttps://doi.org/10.1007/pl00001625openalex-snapshot
Every Graph with a Positive Cheeger Constant Contains a Tree with a Positive Cheeger Constant
inferred← citeshttps://doi.org/10.1007/s00373-009-0860-xopenalex-snapshot
Induced-Universal Graphs for Graphs with Bounded Maximum Degree
inferred← citeshttps://doi.org/10.1007/s00493-006-0002-5openalex-snapshot
Global Connectivity And Expansion: Long Cycles and Factors In f-Connected Graphs
inferred← citeshttps://doi.org/10.1007/s00493-007-2182-zopenalex-snapshot
Embedding nearly-spanning bounded degree trees
inferred← citeshttps://doi.org/10.1007/s00493-010-2422-5openalex-snapshot
A randomized embedding algorithm for trees
inferred← citeshttps://doi.org/10.1007/s00493-014-3002-xopenalex-snapshot
Isoperimetric inequalities in simplicial complexes
inferred← citeshttps://doi.org/10.1007/s00493-017-3701-1openalex-snapshot
Long Cycles in Locally Expanding Graphs, with Applications
inferred← citeshttps://doi.org/10.1007/s00493-020-4434-0openalex-snapshot
Cycle Lengths in Expanding Graphs
inferred← citeshttps://doi.org/10.1007/s00493-023-00033-8openalex-snapshot
Routing Permutations on Spectral Expanders via Matchings
inferred← citeshttps://doi.org/10.1007/s00493-023-00034-7openalex-snapshot
Three Early Problems on Size Ramsey Numbers
inferred← citeshttps://doi.org/10.1007/s00493-024-00091-6openalex-snapshot
Small Subgraphs with Large Average Degree
inferred← citeshttps://doi.org/10.1007/s00493-024-00103-5openalex-snapshot
Effective Bounds for Induced Size-Ramsey Numbers of Cycles
inferred← citeshttps://doi.org/10.1007/s10878-017-0214-1openalex-snapshot
Sparse multipartite graphs as partition universal for graphs with bounded degree
inferred← citeshttps://doi.org/10.1007/s11856-019-1828-zopenalex-snapshot
Spectrum and combinatorics of two-dimensional Ramanujan complexes
inferred← citeshttps://doi.org/10.1016/0012-365x(88)90189-6openalex-snapshot
Explicit construction of linear sized tolerant networks
inferred← citeshttps://doi.org/10.1016/0020-0190(90)90173-uopenalex-snapshot
The cover time of a regular expander is O(n log n)
inferred← citeshttps://doi.org/10.1016/0095-8956(91)90089-3openalex-snapshot
A ramsey type problem concerning vertex colourings
inferred← citeshttps://doi.org/10.1016/j.aim.2011.01.004openalex-snapshot
Sparse partition universal graphs for graphs of bounded degree
inferred← citeshttps://doi.org/10.1016/j.aim.2019.106793openalex-snapshot
Spanning trees in random graphs
inferred← citeshttps://doi.org/10.1016/j.aim.2024.109984openalex-snapshot
Hamilton cycles in pseudorandom graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2006.03.025openalex-snapshot
Explicit construction of linear sized tolerant networks
inferred← citeshttps://doi.org/10.1016/j.disc.2016.02.001openalex-snapshot
The vertex size-Ramsey number
inferred← citeshttps://doi.org/10.1016/j.disc.2017.08.016openalex-snapshot
Degree Ramsey numbers for even cycles
inferred← citeshttps://doi.org/10.1016/j.disc.2026.115430openalex-snapshot
New bounds on the size-Ramsey numbers of hypergraphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2010.09.005openalex-snapshot
Global Maker–Breaker games on sparse graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2012.01.007openalex-snapshot
Fast embedding of spanning trees in biased Maker–Breaker games
inferred← citeshttps://doi.org/10.1016/j.ejc.2012.08.004openalex-snapshot
Degree Ramsey numbers for cycles and blowups of trees
inferred← citeshttps://doi.org/10.1016/j.jctb.2005.04.005openalex-snapshot
Monotone maps, sphericity and bounded second eigenvalue
inferred← citeshttps://doi.org/10.1016/j.jctb.2011.10.002openalex-snapshot
The size Ramsey number of a directed path
inferred← citeshttps://doi.org/10.1016/j.jctb.2020.06.004openalex-snapshot
The multicolour size-Ramsey number of powers of paths
inferred← citeshttps://doi.org/10.1016/j.jctb.2022.10.003openalex-snapshot
The multicolor size-Ramsey numbers of cycles
inferred← citeshttps://doi.org/10.1016/j.jctb.2025.02.004openalex-snapshot
Ramsey numbers of bounded degree trees versus general graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2026.01.004openalex-snapshot
Universality for graphs with bounded density
inferred← citeshttps://doi.org/10.1016/s0166-218x(03)00263-4openalex-snapshot
Sparse networks tolerating random faults
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70766-0openalex-snapshot
Explicit Construction of Linear Sized Tolerant Networks
inferred← citeshttps://doi.org/10.1017/9781108332699.003openalex-snapshot
Large-scale structures in random graphs
inferred← citeshttps://doi.org/10.1017/cbo9781316106853.003openalex-snapshot
Recent developments in graph Ramsey theory
inferred← citeshttps://doi.org/10.1017/s0963548300000936openalex-snapshot
Deterministic Graph Games and a Probabilistic Intuition
inferred← citeshttps://doi.org/10.1017/s096354830000122xopenalex-snapshot
On Universal Threshold Graphs
inferred← citeshttps://doi.org/10.1017/s0963548311000617openalex-snapshot
Degree Ramsey Numbers of Graphs
inferred← citeshttps://doi.org/10.1017/s0963548312000533openalex-snapshot
Expanders Are Universal for the Class of All Spanning Trees
inferred← citeshttps://doi.org/10.1017/s0963548313000151openalex-snapshot
Size Ramsey Number of Bounded Degree Graphs for Games
inferred← citeshttps://doi.org/10.1017/s0963548315000310openalex-snapshot
Manipulative Waiters with Probabilistic Intuition
inferred← citeshttps://doi.org/10.1017/s0963548317000116openalex-snapshot
Mixing in High-Dimensional Expanders
inferred← citeshttps://doi.org/10.1017/s0963548317000554openalex-snapshot
Ramsey Goodness of Bounded Degree Trees
inferred← citeshttps://doi.org/10.1017/s0963548319000221openalex-snapshot
On the Size-Ramsey Number of Cycles
inferred← citeshttps://doi.org/10.1017/s0963548320000322openalex-snapshot
On the size-Ramsey number of grid graphs
inferred← citeshttps://doi.org/10.1017/s0963548323000147openalex-snapshot
On the size-Ramsey number of grids
inferred← citeshttps://doi.org/10.1017/s0963548323000378openalex-snapshot
Spanning trees in graphs without large bipartite holes
inferred← citeshttps://doi.org/10.1017/s0963548325000070openalex-snapshot
Hamiltonicity of sparse pseudorandom graphs
inferred← citeshttps://doi.org/10.1017/s0963548326100480openalex-snapshot
Spanning clique subdivisions in pseudorandom graphs
inferred← citeshttps://doi.org/10.1051/ita:2005019openalex-snapshot
A note on the Size-Ramsey number of long subdivisions of graphs
inferred← citeshttps://doi.org/10.1090/proc/17139openalex-snapshot
Spanning trees in pseudorandom graphs via sorting networks
inferred← citeshttps://doi.org/10.1090/proc/17243openalex-snapshot
Induced Ramsey problems for trees and graphs with bounded treewidth
inferred← citeshttps://doi.org/10.1090/s0894-0347-1989-0965008-xopenalex-snapshot
Diameters and Eigenvalues
inferred← citeshttps://doi.org/10.1090/tran/7727openalex-snapshot
Optimal threshold for a random graph to be 2-universal
inferred← citeshttps://doi.org/10.1090/tran/8660openalex-snapshot
Rolling backwards can move you forward: On embedding problems in sparse expanders
inferred← citeshttps://doi.org/10.1109/12.142684openalex-snapshot
Fast algorithms for routing around faults in multibutterflies and randomly-wired splitter networks
inferred← citeshttps://doi.org/10.1109/apccas.2000.913641openalex-snapshot
Sparse networks tolerating random faults for tree-like and butterfly-like networks
inferred← citeshttps://doi.org/10.1109/ccc.2010.34openalex-snapshot
Relationless Completeness and Separations
inferred← citeshttps://doi.org/10.1109/focs.2015.84openalex-snapshot
Optimal Induced Universal Graphs and Adjacency Labeling for Trees
inferred← citeshttps://doi.org/10.1109/ipdps.2009.5160985openalex-snapshot
Path-robust multi-channel wireless networks
inferred← citeshttps://doi.org/10.1109/ispan.1999.778926openalex-snapshot
Sparse networks tolerating random faults
inferred← citeshttps://doi.org/10.1109/pccc.1992.200592openalex-snapshot
Efficient distributed reconfiguration for binary trees on Diogenes model
inferred← citeshttps://doi.org/10.1109/sfcs.1986.38openalex-snapshot
Optimal simulations of tree machines
inferred← citeshttps://doi.org/10.1109/sfcs.1991.185397openalex-snapshot
Better expansion for Ramanujan graphs
inferred← citeshttps://doi.org/10.1109/sfcs.1996.548467openalex-snapshot
Short paths in expander graphs
inferred← citeshttps://doi.org/10.1109/sfcs.2002.1181882openalex-snapshot
Small induced-universal graphs and compact implicit graph representations
inferred← citeshttps://doi.org/10.1109/spdp.1991.218202openalex-snapshot
Explicit construction for reliable reconfigurable array architectures
inferred← citeshttps://doi.org/10.1112/blms.12682openalex-snapshot
The size‐Ramsey number of cubic graphs
inferred← citeshttps://doi.org/10.1112/blms.13022openalex-snapshot
Almost spanning distance trees in subsets of finite vector spaces
inferred← citeshttps://doi.org/10.1112/jlms.12408openalex-snapshot
The size‐Ramsey number of powers of bounded degree trees
inferred← citeshttps://doi.org/10.1112/jlms.12718openalex-snapshot
Turán‐type problems for long cycles in random and pseudo‐random graphs
inferred← citeshttps://doi.org/10.1112/jlms.70116openalex-snapshot
Size‐Ramsey numbers of graphs with maximum degree three
inferred← citeshttps://doi.org/10.1137/0221012openalex-snapshot
Efficient Embeddings of Trees in Hypercubes
inferred← citeshttps://doi.org/10.1137/0402014openalex-snapshot
Universal Graphs for Bounded-Degree Trees and Planar Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611973099.122openalex-snapshot
Expanders Are Universal for the Class of All Spanning Trees (Extended Abstract)
inferred← citeshttps://doi.org/10.1137/1.9781611973730.131openalex-snapshot
Contagious Sets in Expanders
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch90openalex-snapshot
Small subgraphs with large average degree
inferred← citeshttps://doi.org/10.1137/100805753openalex-snapshot
Embedding Spanning Trees in Random Graphs
inferred← citeshttps://doi.org/10.1137/130942437openalex-snapshot
Universality of Random Graphs for Graphs of Maximum Degree Two
inferred← citeshttps://doi.org/10.1137/140982842openalex-snapshot
The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition
inferred← citeshttps://doi.org/10.1137/20m1335790openalex-snapshot
The Size Ramsey Number of Graphs with Bounded Treewidth
inferred← citeshttps://doi.org/10.1142/s1793830923500076openalex-snapshot
Strong 2-degenerate graph embeddings
inferred← citeshttps://doi.org/10.1145/113379.113393openalex-snapshot
Simulating binary trees on X-trees (extended abstract)
inferred← citeshttps://doi.org/10.1145/181014.181407openalex-snapshot
Construction of the mesh and the torus tolerating a large number of faults
inferred← citeshttps://doi.org/10.1145/28395.28424openalex-snapshot
Constructing disjoint paths on expander graphs
inferred← citeshttps://doi.org/10.1145/3088513openalex-snapshot
Optimal Induced Universal Graphs and Adjacency Labeling for Trees
inferred← citeshttps://doi.org/10.1145/3717823.3718184openalex-snapshot
Disjoint Connected Dominating Sets in Pseudorandom Graphs
inferred← citeshttps://doi.org/10.1145/73007.73062openalex-snapshot
The electrical resistance of a graph captures its commute and cover times
inferred← citeshttps://doi.org/10.11606/d.45.2007.tde-08052007-182205openalex-snapshot
Relações min-max em otimização combinatória
inferred← citeshttps://doi.org/10.18452/13975openalex-snapshot
Regular partitions of hypergraphs and property testing
inferred← citeshttps://doi.org/10.2298/petf0314001mopenalex-snapshot
Antiregular graphs are universal for trees
inferred← citeshttps://doi.org/10.37236/2526openalex-snapshot
Degree Ramsey Numbers of Closed Blowups of Trees
inferred← citeshttps://doi.org/10.37236/278openalex-snapshot
Large Bounded Degree Trees in Expanding Graphs
inferred← citeshttps://doi.org/10.37236/851openalex-snapshot
An Algorithmic Friedman–Pippenger Theorem on Tree Embeddings and Applications
inferred← citeshttps://doi.org/10.3929/ethz-a-007052734openalex-snapshot
Combinatorial Games on Graphs
inferred← citeshttps://doi.org/10.4274/eamr.galenos.2022.27147openalex-snapshot
Maculopapular Drug Eruptions: Diversity of Histopathological Changes
inferred← citeshttps://doi.org/10.4310/sdg.2004.v9.n1.a3openalex-snapshot
Discrete isoperimetric inequalities
inferred← citeshttps://doi.org/10.46298/dmtcs.427openalex-snapshot
On-line Ramsey numbers for paths and stars
inferred← citeshttps://doi.org/10.48550/arxiv.0707.2079openalex-snapshot
Nearly optimal embeddings of trees
inferred← citeshttps://doi.org/10.48550/arxiv.1007.2326openalex-snapshot
Embedding spanning trees in random graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1108.4647openalex-snapshot
Expanders Are Universal for the Class of All Spanning Trees
inferred← citeshttps://doi.org/10.48550/arxiv.1211.3050openalex-snapshot
The approximate Loebl-Komlós-Sós Conjecture
inferred← citeshttps://doi.org/10.48550/arxiv.1310.5873openalex-snapshot
Universality of random graphs for graphs of maximum degree two
inferred← citeshttps://doi.org/10.48550/arxiv.1405.6559openalex-snapshot
Embedding bounded degree spanning trees in random graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1411.6966openalex-snapshot
Sparse Multipartite Graphs as Partition Universal for Graphs of Bounded-Degrees
inferred← citeshttps://doi.org/10.48550/arxiv.1503.06304openalex-snapshot
On the size-Ramsey number of hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1906.08234openalex-snapshot
On edge-ordered Ramsey numbers
inferred← citeshttps://doi.org/10.48550/arxiv.2103.01942openalex-snapshot
Size-Ramsey numbers of powers of hypergraph trees and long subdivisions
inferred← citeshttps://doi.org/10.48550/arxiv.2106.16023openalex-snapshot
Multicolor Size-Ramsey Number of Cycles
inferred← citeshttps://doi.org/10.5555/545381.545424openalex-snapshot
Mixing time and long paths in graphs
inferred← citeshttps://doi.org/10.5753/etc.2017.3198openalex-snapshot
Número de Ramsey relativo a arestas de potências de caminhos
inferred← citeshttps://doi.org/10.5802/aif.3695openalex-snapshot
Eigenvalue asymptotics and unique continuation of eigenfunctions on planar graphs
inferred← citeshttps://doi.org/10.5817/cz.muni.eurocomb23-002openalex-snapshot
Partition Universality for Hypergraphs of Bounded Degeneracy and Degree
inferred← citeshttps://doi.org/10.5817/cz.muni.eurocomb23-027openalex-snapshot
Effective bounds for induced size-Ramsey numbers of cycles
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.