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
Density conditions for k vertex-disjoint triangles in tripartite graphs
Zhengzhou University, Zhengzhou, China.
Umeå University, Faculty of Science and Technology, Department of Mathematics and Mathematical Statistics.
2026 (English)In: Journal of Graph Theory, ISSN 0364-9024, E-ISSN 1097-0118Article in journal (Refereed) Epub ahead of print
Abstract [en]

Let (Formula presented.) be positive integers such that (Formula presented.) and (Formula presented.) be a tripartite graph with parts (Formula presented.) such that (Formula presented.). Denote the edge densities of (Formula presented.) and (Formula presented.) by (Formula presented.) and (Formula presented.), respectively. In this paper, we study edge density conditions for the existence of (Formula presented.) vertex-disjoint triangles in a tripartite graph. For (Formula presented.) we give an optimal condition in terms of densities (Formula presented.) for the existence of (Formula presented.) vertex-disjoint triangles in (Formula presented.). We also give an optimal condition in terms of densities (Formula presented.) for the existence of a triangle-factor in (Formula presented.).

Place, publisher, year, edition, pages
John Wiley & Sons, 2026.
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:umu:diva-256011DOI: 10.1002/jgt.70079ISI: 001796628800001Scopus ID: 2-s2.0-105042241396OAI: oai:DiVA.org:umu-256011DiVA, id: diva2:2082039
Available from: 2026-06-30 Created: 2026-06-30 Last updated: 2026-06-30

Open Access in DiVA

fulltext(3315 kB)58 downloads
File information
File name FULLTEXT01.pdfFile size 3315 kBChecksum SHA-512
66e3c0415a131b98eff5a4ef0723b01d09ac8c53eeaf4205fca9e7ad70f5f41e380eca186fda62260cadff5ef8bf63548a8e572f5395116cba58b55dd50da3d7
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Authority records

Markström, Klas

Search in DiVA

By author/editor
Markström, Klas
By organisation
Department of Mathematics and Mathematical Statistics
In the same journal
Journal of Graph Theory
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
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: 650 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