Umeå University's logo

umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
On an extremal problem for locally sparse multigraphs
Umeå University, Faculty of Science and Technology, Department of Mathematics and Mathematical Statistics.ORCID iD: 0000-0001-8631-4745
2024 (English)In: European journal of combinatorics (Print), ISSN 0195-6698, E-ISSN 1095-9971, Vol. 118, article id 103887Article in journal (Refereed) Published
Abstract [en]

A multigraph G is an (s,q)-graph if every s-set of vertices in G supports at most q edges of G, counting multiplicities. Mubayi and Terry posed the problem of determining the maximum of the product of the edge-multiplicities in an (s,q)-graph on n vertices. We give an asymptotic solution to this problem for the family (s,q)=(2r,a(2r2)+ex(2r,Kr+1)−1) with r,a ∈ Z≥2. This greatly generalises previous results on the problem due to Mubayi and Terry and to Day, Treglown and the author, who between them had resolved the special case r=2. Our result asymptotically confirms an infinite family of cases in (and overcomes a major obstacle to a resolution of) a conjecture of Day, Treglown and the author.

Place, publisher, year, edition, pages
Elsevier, 2024. Vol. 118, article id 103887
National Category
Discrete Mathematics Probability Theory and Statistics
Identifiers
URN: urn:nbn:se:umu:diva-217221DOI: 10.1016/j.ejc.2023.103887ISI: 001123026000001Scopus ID: 2-s2.0-85177206014OAI: oai:DiVA.org:umu-217221DiVA, id: diva2:1815596
Available from: 2023-11-29 Created: 2023-11-29 Last updated: 2025-04-24Bibliographically approved

Open Access in DiVA

fulltext(489 kB)260 downloads
File information
File name FULLTEXT01.pdfFile size 489 kBChecksum SHA-512
33787ad6cb08242316b77b4541ed49849714103e219c4399168412d4516af2882c41427e02c4741ddd99cd09b5b3c0047a33d3c1069d3ef69fc88a25323d3855
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Authority records

Falgas-Ravry, Victor

Search in DiVA

By author/editor
Falgas-Ravry, Victor
By organisation
Department of Mathematics and Mathematical Statistics
In the same journal
European journal of combinatorics (Print)
Discrete MathematicsProbability Theory and Statistics

Search outside of DiVA

GoogleGoogle Scholar
Total: 261 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 580 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf