arXiv (All)
open access
Extremal Spanning Trees of Random Marked Graphs with Independent Edge Weights
In this paper, we consider a Bernoulli random graph~\(G\) on~\(n\) vertices with non-uniform edge probabilities, where each vertex has an independent mark and each edge is equipped with an independent positive weight. The cost of an edge depends on the weight as well the marks of the endvertices 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
- On average degree of power graphs#438422
- Extremal Spanning Trees in Product Grid Graphs#1117479
- From second moments to pairwise negative correlation: applications to minimal and uniform spanning trees#1049819
- Local Search for Almost-Spanning Square Grids in Erdős--Rényi Random Graphs#1070133
- Bootstrap percolation on a generalized Hamming cube \MakeUppercase{\romannumeral 2}#799850
Record · ID 1062064
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