Pages that link to "Item:Q4014271"
From MaRDI portal
The following pages link to On the minimum size of tight hypergraphs (Q4014271):
Displaying 18 items.
- Null and non-rainbow colorings of projective plane and sphere triangulations (Q299082) (← links)
- Maximum number of colors in hypertrees of bounded degree (Q302137) (← links)
- On the heterochromatic number of hypergraphs associated to geometric graphs and to matroids (Q367058) (← links)
- The acyclic and \(\overset\rightarrow C_3\)-free disconnection of tournaments (Q393468) (← links)
- Maximum number of colors: C-coloring and related problems (Q408951) (← links)
- Looseness and independence number of triangulations on closed surfaces (Q726633) (← links)
- On a heterochromatic number for hypercubes (Q932668) (← links)
- Smallest set-transversals of \(k\)-partitions (Q968226) (← links)
- Circulant tournaments of prime order are tight (Q998344) (← links)
- Points surrounding the origin (Q1046738) (← links)
- The acyclic disconnection of a digraph (Q1292866) (← links)
- Tightness problems in the plane (Q1297464) (← links)
- Some heterochromatic theorems for matroids (Q1660247) (← links)
- Proper colorings of plane quadrangulations without rainbow faces (Q2051893) (← links)
- Approximability of the upper chromatic number of hypergraphs (Q2346334) (← links)
- An anti-Ramsey theorem on cycles (Q2573806) (← links)
- Looseness ranges of triangulations on closed surfaces (Q2576861) (← links)
- Looseness width of 5-connected triangulations on the torus (Q5300991) (← links)
