Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number
From MaRDI portal
Publication:2091099
DOI10.1007/s10878-022-00893-8zbMath1505.90113OpenAlexW4292970961MaRDI QIDQ2091099
Zhongzheng Tang, Zhuo Diao, Yu Cong Tang
Publication date: 31 October 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-022-00893-8
Cites Work
- Induced cycles in triangle graphs
- Packing and covering tetrahedra
- A stability theorem on fractional covering of triangles by edges
- Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture
- Covering triangles in edge-weighted graphs
- Integer and fractional packings in dense graphs
- Packing and covering triangles in planar graphs
- Matching and covering the vertices of a random graph by copies of a given graph
- Packing and covering triangles in graphs
- Packing and covering triangles in tripartite graphs
- Matchings and covers in hypergraphs
- On a conjecture of Tuza about packing and covering of triangles
- Covering and independence in triangle structures
- Packing and covering triangles in \(K_{4}\)-free planar graphs
- On the feedback number of 3-uniform linear extremal hypergraphs
- A conjecture on triangles of graphs
- Tuza's conjecture for graphs with maximum average degree less than 7
- Triangle packings and transversals of some \(K_{4}\)-free graphs
- Sufficient Conditions for Tuza’s Conjecture on Packing and Covering Triangles
- Dense Graphs With a Large Triangle Cover Have a Large Triangle Packing
- On a Class of Totally Unimodular Matrices
- Triangle Factors in Random Graphs
- A generalization of Tuza's conjecture
- Multi-transversals for Triangles and the Tuza's Conjecture
- Tuza's Conjecture is Asymptotically Tight for Dense Graphs
- On Tuza's conjecture for triangulations and graphs with small treewidth
This page was built for publication: Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number
