◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Dániel Grósz

3 papers hereh-index 380 citations8 works total

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

author position
  • first 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

activity
20142018
most citedAn improvement of the general bound on the largest family of subsets avoiding a subposet

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

collaborators
Showing 2016Show all

1 paper · 1 filter

math.CO2016

An upper bound on the size of diamond-free families of sets

Dániel Grósz, Abhishek Methuku, Casey Tompkins

Let La(n,P) be the maximum size of a family of subsets of [n]={1,2,...,n} not containing P as a (weak) subposet. The diamond poset, denoted B2​, is defined on four elem…

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