◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

J. Nesetril

64 papers hereh-index 5011.5k citations425 works total

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

author position
  • first author25
  • middle author16
  • last author22

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

fields
  • math.CO50
  • cs.DM4
  • cs.LO4
  • math.LO2
  • cs.CC1
  • math.CT1

identity via Semantic Scholar / OpenAlex

activity
20042023
most citedCharacterisations and Examples of Graph Classes with Bounded Expansion

89 citations · 408 across the 56 of their papers we have counts for

collaborators
Showing 2004 · math.LOShow all

1 paper · 2 filters

math.LO2004

On the order of countable graphs

Jaroslav Nešetřil, Saharon Shelah

A set of graphs is said to be independent if there is no homomorphism between distinct graphs from the set. We consider the existence problems related to the independent sets of co…

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