On the public citation graph

A Note on Forbidding Clique Immersions

https://doi.org/10.37236/2533
0 signed · 26 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.1016/j.ejc.2012.02.002openalex-snapshot
Immersing complete digraphs
inferredcites →https://doi.org/10.1016/j.jctb.2009.07.003openalex-snapshot
Graph minors XXIII. Nash-Williams' immersion conjecture
inferredcites →https://doi.org/10.1016/j.jctb.2010.10.003openalex-snapshot
A well-quasi-order for tournaments
inferredcites →https://doi.org/10.1016/j.jctb.2014.07.003openalex-snapshot
The structure of graphs not admitting a fixed immersion
inferredcites →https://doi.org/10.1137/0109047openalex-snapshot
Multi-Terminal Network Flows
inferredcites →https://doi.org/10.48550/arxiv.1101.2630openalex-snapshot
Minimum degree condition forcing complete graph immersion
inferredcites →https://doi.org/10.48550/arxiv.1302.3867openalex-snapshot
The structure of graphs not admitting a fixed immersion

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.21990openalex-snapshot
A Structure Theorem for Strong Immersions
inferred← citeshttps://doi.org/10.1002/jgt.22430openalex-snapshot
Nonrepetitive colorings of graphs excluding a fixed immersion or topological minor
inferred← citeshttps://doi.org/10.1002/jgt.22677openalex-snapshot
The structure of graphs with no W4 immersion
inferred← citeshttps://doi.org/10.1002/jgt.23245openalex-snapshot
A Grid Theorem for Strong Immersions of Walls
inferred← citeshttps://doi.org/10.1007/s11856-023-2572-yopenalex-snapshot
Immersion of complete digraphs in Eulerian digraphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2014.07.003openalex-snapshot
The structure of graphs not admitting a fixed immersion
inferred← citeshttps://doi.org/10.1016/j.jctb.2022.07.009openalex-snapshot
On objects dual to tree-cut decompositions
inferred← citeshttps://doi.org/10.1016/j.jctb.2025.11.009openalex-snapshot
On digraphs without onion star immersions
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.06.006openalex-snapshot
Edge degeneracy: Algorithmic and structural results
inferred← citeshttps://doi.org/10.1017/9781009490559.005openalex-snapshot
Sublinear Expanders and Their Applications
inferred← citeshttps://doi.org/10.1112/jlms.12127openalex-snapshot
Improper colourings inspired by Hadwiger's conjecture
inferred← citeshttps://doi.org/10.1137/1.9781611975031.15openalex-snapshot
A submodular measure and approximate Gomory-Hu theorem for packing odd trails
inferred← citeshttps://doi.org/10.1137/130924056openalex-snapshot
Immersions in Highly Edge Connected Graphs
inferred← citeshttps://doi.org/10.37236/7406openalex-snapshot
Defective and Clustered Graph Colouring
inferred← citeshttps://doi.org/10.48550/arxiv.1302.3867openalex-snapshot
The structure of graphs not admitting a fixed immersion
inferred← citeshttps://doi.org/10.48550/arxiv.1305.1331openalex-snapshot
Immersions in highly edge connected graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1905.01830openalex-snapshot
Well-quasi-order of plane minors and an application to link diagrams
inferred← citeshttps://doi.org/10.5555/2884435.2884580openalex-snapshot
Weak duality for packing edge-disjoint odd (u, v)-trails
inferred← citeshttps://doi.org/10.70675/55116f76z4284z480ezbca9z9f239cb69991openalex-snapshot
Etude de Dégénérescence de Graph appliqué à l'Apprentissage Automatique Avancé et Résultats Théoriques relatifs
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.