arXiv (All)
open access
Extremal problems for cancellative and locally thin hypergraphs
We study Turán-type extremal problems for cancellative and locally thin uniform hypergraphs. An $r$-uniform hypergraph is $t$-cancellative if $(\cup_{i=1}^t A_i)\cup B\ne (\cup_{i=1}^t A_i)\cup C$ whenever $A_1,\ldots,A_t,B,C$ are distinct edges. Let $C_t(n,r)$ denote the maximum number of edges in
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Linear Tur'an Numbers of Four-Edge Uniform Paths via Incidence Rank#1033943
- An analogue of a problem of Littlewood#490218
- Near-optimal edge partitioning via intersecting families#1141416
- New Upper bounds on the Mondrian Art Problem#822406
- Maximum Strong Independent Sets in Hypergraphs: Reductions, Bounds, and Greedy Certificates#1011663
Record · ID 986484
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive