Pages that link to "Item:Q1171575"
From MaRDI portal
The following pages link to Triangle-free partial graphs and edge covering theorems (Q1171575):
Displaying 11 items.
- Bisections of graphs (Q461728) (← links)
- Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices (Q802577) (← links)
- Maximum bipartite subgraphs of Kneser graphs (Q1121290) (← links)
- Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdős inequality (Q1297468) (← links)
- Covering a graph by topological complete subgraphs (Q1813985) (← links)
- Covers in hypergraphs (Q1838499) (← links)
- Covering and independence in triangle structures (Q1916100) (← links)
- A conjecture on triangles of graphs (Q2276982) (← links)
- Bipartite subgraphs (Q2563506) (← links)
- Maximum directed cuts in digraphs with degree restriction (Q3633002) (← links)
- Covering the edges of a graph with triangles (Q6635092) (← links)
