◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Hans Ulrich Simon

2 papers here

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

author position
  • sole author2

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

fields
  • cs.DM1
  • math.CO1
ORCID 0000-0002-1587-0944

identity via Semantic Scholar / OpenAlex

collaborators

2 papers

math.CO2024

A Note on the Subcubes of the n-Cube

Hans Ulrich Simon

In the year 1990, Béla Bollobás, Imre Leader and Andrew Radcliffe considered the following combinatorial problem: given three parameters k, n and q, find a set of k vertices in the…

cs.DM2024

Greedy Matchings in Bipartite Graphs with Ordered Vertex Sets

Hans U. Simon

We define and study greedy matchings in vertex-ordered bipartite graphs. It is shown that each vertex-ordered bipartite graph has a unique greedy matching. The proof uses (a weak f…

◍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.