Almost partitioning 2‐colored complete 3‐uniform hypergraphs into two monochromatic tight or loose cycles (Q5379835): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q128987552, #quickstatements; #temporary_batch_1723645614657 |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2901376529 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1701.07806 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q128987552 / rank | |||
Normal rank | |||
Latest revision as of 15:55, 14 August 2024
scientific article; zbMATH DE number 7066119
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Almost partitioning 2‐colored complete 3‐uniform hypergraphs into two monochromatic tight or loose cycles |
scientific article; zbMATH DE number 7066119 |
Statements
Almost partitioning 2‐colored complete 3‐uniform hypergraphs into two monochromatic tight or loose cycles (English)
0 references
14 June 2019
0 references
hypergraph
0 references
loose cycle
0 references
monochromatic partitions
0 references
tight cycle
0 references
