◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

M. Hujter

6 papers hereh-index 8591 citations25 works total

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

author position
  • first author4
  • middle author2

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

fields
  • math.CO3
  • math.MG2
  • cs.DM1

identity via Semantic Scholar / OpenAlex

activity
20122021
most citedOn the multiple Borsuk numbers of sets

5 citations · 7 across the 6 of their papers we have counts for

collaborators
Showing 2021Show all

2 papers · 1 filter

math.MG2021

Cubes and Boxes have Rupert's passages in every direction

András Bezdek, Zhenyue Guan, Mihály Hujter +1

It is a 300 year old counterintuitive observation of Prince Rupert of Rhine that in cube a straight tunnel can be cut, through which a second congruent cube can be passed. Hundre…

math.CO2021

Precoloring Extension. IV. General Bounds and List Colorings

Mihály Hujter, Zsolt Tuza

A guaranteed upper bound is proved for the time complexity of the list-coloring problem on graphs.

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