◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Barnabás Janzer

21 papers hereh-index 595 citations22 works total

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

author position
  • sole author8
  • first author7
  • middle author5
  • last author1

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

fields
  • math.CO19
  • cs.LG1
  • math.MG1

identity via Semantic Scholar / OpenAlex

activity
20172025
most citedGeneralizations of the Ruzsa-Szemerédi and rainbow Turán problems for cliques

18 citations · 39 across the 17 of their papers we have counts for

collaborators
Showing 2017Show all

1 paper · 1 filter

math.CO2017★ 5 cited

A New Upper Bound for Cancellative Pairs

Barnabás Janzer

A pair (A,B) of families of subsets of an n-element set is called cancellative if whenever A,A′∈A and B∈B satisfy $A\cup B=A'\cu…

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