◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

C. Thomassen

10 papers hereh-index 5711.3k citations249 works total

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

author position
  • sole author1
  • first author1
  • middle author2
  • last author6

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

fields
  • math.CO8
  • cs.IT2

identity via Semantic Scholar / OpenAlex

activity
20122021
most citedGroup connectivity and group coloring: small groups versus large groups

8 citations · 15 across the 7 of their papers we have counts for

collaborators
Showing 2012 · cs.ITShow all

2 papers · 2 filters

cs.IT2012★ 3 cited

The maximum number of minimal codewords in an [n,k]−code

A. Alahmadi, R. E. L. Aldred, R. dela Cruz +2

Upper and lower bounds are derived for the quantity in the title, which is tabulated for modest values of n and k. An application to graphs with many cycles is given.

cs.IT2012

The maximum number of minimal codewords in long codes

Adel Alahmadi, R. E. L. Aldred, Romar dela Cruz +2

Upper bounds on the maximum number of minimal codewords in a binary code follow from the theory of matroids. Random coding provide lower bounds. In this paper we compare these boun…

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