◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Stefan H. M. van Zwam

3 papers here

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • last author3

Across the 3 of 3 papers where every author was matched, so the position is known.

fields
  • math.CO3

identity via Semantic Scholar / OpenAlex

most citedStability, fragility, and Rota's Conjecture

1 citations · 1 across the 3 of their papers we have counts for

collaborators
Showing math.COShow all

3 papers · 1 filter

math.CO2014

On the existence of asymptotically good linear codes in minor-closed classes

Peter Nelson, Stefan H. M. van Zwam

Let C=(C1​,C2​,…) be a sequence of codes such that each Ci​ is a linear [ni​,ki​,di​]-code over some fixed finite field F, where ni​ is the le…

math.CO2010

The structure of graphs with a vital linkage of order 2

Dillon Mayhew, Geoff Whittle, Stefan H. M. van Zwam

A linkage of order k of a graph G is a subgraph with k components, each of which is a path. A linkage is vital if it spans all vertices, and no other linkage connects the same pair…

math.CO2010★ 1 cited

Stability, fragility, and Rota's Conjecture

Dillon Mayhew, Geoff Whittle, Stefan H. M. van Zwam

Fix a matroid N. A matroid M is N-fragile if, for each element e of M, at least one of M\e and M/e has no N-minor. The Bounded Canopy Conjecture is that all GF(q)-representable mat…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.