{"total":5,"items":[{"citing_arxiv_id":"2606.24675","ref_index":5,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"A Congestion Parameter for Depth-First Graph Traversals","primary_cat":"cs.DM","submitted_at":"2026-06-23T15:07:00+00:00","verdict":"CONDITIONAL","verdict_confidence":"MODERATE","novelty_score":7.0,"formal_verification":"none","one_line_summary":"KLX is the min-max congestion of open back edges over DFS traversals; graphs with KLX at most 2 are fully characterized with linear-time recognition, any graph has tree-width at most KLX+1, and KLX ≤ k is MSO2-expressible hence linear-time decidable for fixed k.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.04006","ref_index":3,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Saddle-Point Asymptotics for Chromatic and Tutte Polynomial Evaluations of Complete Multipartite Graphs","primary_cat":"math.CO","submitted_at":"2026-05-05T17:28:40+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Saddle-point asymptotics for chromatic and Tutte polynomials of complete multipartite graphs prove Kotesovec's fixed-column conjecture and yield fixed-part and all-order expansions for OEIS sequences.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.24571","ref_index":5,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"Polynomial Kernels for Spanning Tree with Diversity Requirements","primary_cat":"cs.DS","submitted_at":"2026-04-27T15:00:50+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Polynomial kernels exist for Leaf & Internal-Constrained Diverse Spanning Trees (parameter p+q+k+ℓ) and Leaf & Non-terminal-Constrained Diverse Spanning Trees (parameter p+|V_NT|+k+ℓ).","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"disjoint spanning trees [ 41, 20] or spanning trees with the minimum sum of all pairwise Hamming distances [ 33] can be found in polynomial time, the computational complexity of finding pairwise k-diverse spanning trees is open. If k = 2, then pairwise k-diverse spanning trees are distinct trees. Because distinct spanning trees of a given graph can be counted by Kirchhoff's matrix tree theorem (see, e.g., [ 5]), it can be decided in polynomial time whether a graph has ℓ pairwise 2-diverse spanning trees. However, for k > 2, it is unknown whether finding three pairwise k-diverse spanning trees is polynomial or NP-hard. The other set of open problems stems from directed graphs. What is the complexity of finding diverse spanning trees (i.e., outbranchings) in directed graphs?"},{"citing_arxiv_id":"2602.17276","ref_index":8,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"RLGT: A reinforcement learning framework for extremal graph theory","primary_cat":"cs.LG","submitted_at":"2026-02-19T11:25:22+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"RLGT is a modular reinforcement learning framework for extremal graph theory that handles undirected, directed, looped, and multi-colored graphs to facilitate future research.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2602.10125","ref_index":23,"ref_count":1,"confidence":0.88,"is_internal_anchor":false,"paper_title":"How segmented is my network?","primary_cat":"cs.SI","submitted_at":"2026-01-31T15:28:09+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":4.0,"formal_verification":"none","one_line_summary":"Segmentedness is defined as the complement of edge density in the policy graph, with a sampling-based estimator requiring only 97 random node pairs for a 95% confidence interval of width ±0.2 independent of network size.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null}],"limit":50,"offset":0}