arXiv (All)
open access
Intersections of Directed Graphs
Given two weighted directed graphs of order \(n\), we study how much their overlap can deviate from its random average under relabelling, and how concentrated the distribution of their intersection is when they are placed at random. Bollobás and Scott studied these problems on weighted $k$-uniform h
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
- Testing Bipartiteness in Logarithmic Rounds#1155230
- Deterministic Streaming Lower Bounds for Approximate Maximum Clique and Maximum Independent Set#1012810
- On $k$-limited domination: complexity and Sierpiński graphs#1156855
- Algorithms and complexity for monitoring edge-geodetic sets in graphs#291915
- Competing bootstrap processes on the random graph $G(n,p)$#984796
Record · ID 1050273
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