Pages that link to "Item:Q5961544"
From MaRDI portal
The following pages link to On the degree, size, and chromatic index of a uniform hypergraph (Q5961544):
Displaying 17 items.
- Decomposition of bi-colored square arrays into balanced diagonals (Q322180) (← links)
- Coloring 2-intersecting hypergraphs (Q396868) (← links)
- Intersections of hypergraphs (Q473105) (← links)
- Ramsey-nice families of graphs (Q1645058) (← links)
- A tale of stars and cliques (Q1671776) (← links)
- A note on \(G\)-intersecting families (Q1861255) (← links)
- On the sizes of vertex-\(k\)-maximal \(r\)-uniform hypergraphs (Q2334065) (← links)
- Lower bounds on circuit depth of the quantum approximate optimization algorithm (Q2687096) (← links)
- Decomposition of Bicolored Square Arrays into Bichromatic Diagonals (Q2957062) (← links)
- A Stability Theorem for Matchings in Tripartite 3-Graphs (Q4962591) (← links)
- (Q5091136) (← links)
- On the Chromatic Index of Random Uniform Hypergraphs (Q5251625) (← links)
- Hypergraphs without non-trivial intersecting subgraphs (Q5886354) (← links)
- The intersection spectrum of 3‐chromatic intersecting hypergraphs (Q6051524) (← links)
- Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
- On <i>t</i>-Intersecting Hypergraphs with Minimum Positive Codegrees (Q6101018) (← links)
- Uniform hypergraphs under certain intersection constraints between hyperedges (Q6113513) (← links)