The following pages link to The size of minimum 3-trees (Q3422128):
Displaying 11 items.
- Small cores in 3-uniform hypergraphs (Q345139) (← links)
- Maximum number of colors: C-coloring and related problems (Q408951) (← links)
- Almost all triangle-free triple systems are tripartite (Q452822) (← links)
- The size of minimum 3-trees: Case 2 mod 3 (Q700206) (← links)
- Smallest set-transversals of \(k\)-partitions (Q968226) (← links)
- Forcing large tight components in 3-graphs (Q1715624) (← links)
- Hypergraphs not containing a tight tree with a bounded trunk. II: 3-trees with a trunk of size 2 (Q2309552) (← links)
- Irredundance trees of diameter 3 (Q2675840) (← links)
- On the minimum size of tight hypergraphs (Q4014271) (← links)
- The size of minimum 3-trees: Cases 3 and 4 mod 6 (Q4237725) (← links)
- The size of minimum 3-trees: cases 0 and 1 mod 12 (Q4458979) (← links)
