The following pages link to Covering non-uniform hypergraphs (Q1850546):
Displaying 21 items.
- Uniform hypergraphs containing no grids (Q390731) (← links)
- Equicovering subgraphs of graphs and hypergraphs (Q405168) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- The minimum number of \(e\)-vertex-covers among hypergraphs with \(e\) edges of given ranks (Q1003769) (← links)
- The maximum size of hypergraphs without generalized 4-cycles (Q1024366) (← links)
- Improved bounds for covering complete uniform hypergraphs (Q1190514) (← links)
- Covering a hypergraph of subgraphs (Q1850010) (← links)
- (2)-pancyclic graphs (Q1949119) (← links)
- Improved bounds on a generalization of Tuza's conjecture (Q2094882) (← links)
- Non-repeated cycle lengths and Sidon sequences (Q2130516) (← links)
- Spectral radius, edge-disjoint cycles and cycles of the same length (Q2138553) (← links)
- On the number of edges in some graphs (Q2192131) (← links)
- On the size of graphs without repeated cycle lengths (Q2410242) (← links)
- Cover \(k\)-uniform hypergraphs by monochromatic loose paths (Q2411510) (← links)
- Non-regular graph coverings and lifting the hyperelliptic involution (Q2630641) (← links)
- Partial covering of hypergraphs (Q2921715) (← links)
- (Q3222235) (← links)
- Isomorphic subgraphs in a graph (Q3481741) (← links)
- Approximate Set Covering in Uniform Hypergraphs (Q4366877) (← links)
- Coverings of r—graphs by complete r—partite subgraphs (Q4697821) (← links)
- An old problem of Erdős: a graph without two cycles of the same length (Q6162025) (← links)
