Triangle packing and covering in dense random graphs (Q2084667): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s10878-022-00859-w / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q3503433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large triangle packings and Tuza’s conjecture in sparse random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Tuza's conjecture for triangulations and graphs with small treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-transversals for Triangles and the Tuza's Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing Triangles in Weighted Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient Conditions for Tuza’s Conjecture on Packing and Covering Triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total Dual Integrality of Triangle Covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering triangles in edge-weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering and independence in triangle structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing and covering triangles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing and covering triangles in tripartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer and fractional packings in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing and covering triangles in \(K_{4}\)-free planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stability theorem on fractional covering of triangles by edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture of Tuza about packing and covering of triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle Factors in Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small edge sets meeting all triangles of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced cycles in triangle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability and Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle packings and transversals of some \(K_{4}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tuza's conjecture for graphs with maximum average degree less than 7 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching and covering the vertices of a random graph by copies of a given graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing and covering triangles in dense random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A conjecture on triangles of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dense Graphs With a Large Triangle Cover Have a Large Triangle Packing / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10878-022-00859-W / rank
 
Normal rank

Latest revision as of 00:26, 17 December 2024

scientific article
Language Label Description Also known as
English
Triangle packing and covering in dense random graphs
scientific article

    Statements

    Triangle packing and covering in dense random graphs (English)
    0 references
    0 references
    0 references
    18 October 2022
    0 references
    \({\mathcal{G}}\left(n, p\right)\) model
    0 references
    0 references

    Identifiers