Pages that link to "Item:Q857750"
From MaRDI portal
The following pages link to On the VC-dimension of uniform hypergraphs (Q857750):
Displaying 11 items.
- An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges (Q403932) (← links)
- Unavoidable subhypergraphs: \(\mathbf a\)-clusters (Q640838) (← links)
- Linear algebra methods for Forbidden configurations (Q653981) (← links)
- The VC-dimension of set systems defined by graphs (Q1364472) (← links)
- A uniform version of a theorem by Dvir and Moran (Q2166116) (← links)
- Forbidding complete hypergraphs as traces (Q2478165) (← links)
- Unavoidable subhypergraphs: \(\mathbf a\)-clusters (Q2851439) (← links)
- Hitting Set for hypergraphs of low VC-dimension (Q4606292) (← links)
- On the VC-dimension, covering and separating properties of the cycle and spanning tree hypergraphs of graphs (Q5103874) (← links)
- The VC dimension of <i>k</i>‐uniform random hypergraphs (Q5297140) (← links)
- MULTIVALUED GENERALIZATIONS OF THE FRANKL–PACH THEOREM (Q5389512) (← links)