Pages that link to "Item:Q1168988"
From MaRDI portal
The following pages link to Maximum degree and fractional matchings in uniform hypergraphs (Q1168988):
Displaying 50 items.
- Packing and covering tetrahedra (Q385147) (← links)
- A stability theorem on fractional covering of triangles by edges (Q412272) (← links)
- Covers in partitioned intersecting hypergraphs (Q499465) (← links)
- Partitioning random graphs into monochromatic components (Q510329) (← links)
- On the fractional matching polytope of a hypergraph (Q684403) (← links)
- On linear and semidefinite programming relaxations for hypergraph matching (Q715088) (← links)
- Extremal hypergraphs for Ryser's conjecture (Q721059) (← links)
- On a possible extension of Hall's theorem to bipartite hypergraphs (Q750464) (← links)
- Maximum degree and diversity in intersecting hypergraphs (Q777477) (← links)
- Covering pairs by \(q^ 2+q+1\) sets (Q810520) (← links)
- Mono-multi bipartite Ramsey numbers, designs, and matrices (Q817616) (← links)
- Covering the complete graph by partitions (Q916671) (← links)
- Gallai colorings of non-complete graphs (Q966033) (← links)
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey (Q1014813) (← links)
- Size of monochromatic double stars in edge colorings (Q1015436) (← links)
- Large monochromatic components in colorings of complete 3-uniform hypergraphs (Q1025935) (← links)
- Coloring by two-way independent sets (Q1044959) (← links)
- t-expansive and t-wise intersecting hypergraphs (Q1076693) (← links)
- Finite projective spaces and intersecting hypergraphs (Q1101456) (← links)
- Optima of dual integer linear programs (Q1105488) (← links)
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs (Q1106724) (← links)
- Symmetric designs as the solution of an extremal problem in combinatorial set theory (Q1108273) (← links)
- Vertex coverings by monochromatic cycles and trees (Q1174783) (← links)
- Covering \(t\)-element sets by partitions (Q1180794) (← links)
- An isoperimetric lemma (Q1182970) (← links)
- Intersecting designs from linear programming and graphs of diameter two (Q1322228) (← links)
- Monochromatic coverings and tree Ramsey numbers (Q1322294) (← links)
- Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance (Q1343143) (← links)
- A note on a conjecture of Ryser (Q1346392) (← links)
- Weighted fractional and integral \(k\)-matching in hypergraphs (Q1346702) (← links)
- Projective planes and congestion-free networks (Q1613417) (← links)
- Large monochromatic components and long monochromatic cycles in random hypergraphs (Q1633610) (← links)
- The skiving stock problem and its relation to hypergraph matchings (Q1662646) (← links)
- On Ryser's conjecture for \(t\)-intersecting and degree-bounded hypergraphs (Q1691092) (← links)
- Forcing large tight components in 3-graphs (Q1715624) (← links)
- Colourings without monochromatic disjoint pairs (Q1746571) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- Clique covers and coloring problems of graphs (Q1823258) (← links)
- On a conjecture of Tuza about packing and covering of triangles (Q1896363) (← links)
- Bus interconnection networks (Q1917343) (← links)
- On symmetric intersecting families (Q1987090) (← links)
- Membership criteria and containments of powers of monomial ideals (Q2000797) (← links)
- Combinatorics of unavoidable complexes (Q2011131) (← links)
- Improved bounds on a generalization of Tuza's conjecture (Q2094882) (← links)
- Improved monochromatic double stars in edge colorings (Q2121489) (← links)
- Generalizations and strengthenings of Ryser's conjecture (Q2121724) (← links)
- The geometry and combinatorics of discrete line segment hypergraphs (Q2174575) (← links)
- Fair division with multiple pieces (Q2192068) (← links)
- On the number of distinct differences in an intersecting family (Q2214062) (← links)
- Monochromatic partitions in local edge colorings (Q2220970) (← links)
