arXiv (All)
open access
Property O and Erdős--Szekeres properties in linear hypergraphs
An oriented $k$-uniform hypergraph, or oriented $k$-graph, is said to satisfy Property O if, for every linear ordering of its vertex set, there is some edge oriented consistently with this order. The minimum number $f(k)$ of edges in a $k$-graph with Property O was first studied by Duffus, Kay, and
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
- An Improved Upper Bound on the Threshold Bias of the Oriented-cycle Game#1013408
- A note on efficient k-limited broadcast domination in graphs#659009
- A note on efficient k-limited broadcast domination in graphs#656873
- On $k$-limited domination: complexity and Cartesian products#1156397
- Burling graphs in graphs with large chromatic number#1357052
Record · ID 1186354
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