Pages that link to "Item:Q3287337"

The following pages link to Intersection Theorems for Systems of Sets (Q3287337):

Displaying 50 items.

• Regular subgraphs of uniform hypergraphs (Q273181) (← links)
• Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments (Q329279) (← links)
• Polynomial kernels for weighted problems (Q340549) (← links)
• Turán problems and shadows. II: Trees (Q345098) (← links)
• On sunflowers and matrix multiplication (Q354642) (← links)
• DNF sparsification and a faster deterministic counting algorithm (Q354649) (← links)
• On the size of 3-uniform linear hypergraphs (Q396731) (← links)
• Equicovering subgraphs of graphs and hypergraphs (Q405168) (← links)
• Satisfiability, branch-width and Tseitin tautologies (Q430830) (← links)
• Generalization of Erdős-Gallai edge bound (Q458592) (← links)
• Towards optimal and expressive kernelization for \(d\)-hitting set (Q486984) (← links)
• Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded (Q512562) (← links)
• On Sidon sets which are asymptotic bases (Q532088) (← links)
• The isomorphism conjecture for constant depth reductions (Q619896) (← links)
• How many \(F\)'s are there in \(G\)? (Q648970) (← links)
• On the readability of monotone Boolean formulae (Q652622) (← links)
• Maximum hitting of a set by compressed intersecting families (Q659747) (← links)
• Bisection of trees and sequences (Q685643) (← links)
• Separation with restricted families of sets (Q739393) (← links)
• Families of finite sets with three intersections (Q761458) (← links)
• Decomposition of large uniform hypergraphs (Q762500) (← links)
• Generalizing Galvin and Jónsson's classification to \(N_5\) (Q783290) (← links)
• On finite set-systems whose every intersection is a kernel of a star (Q787982) (← links)
• On disjointly representable sets (Q790112) (← links)
• A combinatorial fact about free algebras (Q790862) (← links)
• Färbungen großer Würfel mit bunten Wegen (Q795038) (← links)
• On the VC-dimension of uniform hypergraphs (Q857750) (← links)
• On the chromaticity of sunflower hypergraphs \(\text{SH}(n,p,h)\) (Q868346) (← links)
• Incomparability in parallel computation (Q919822) (← links)
• M-embedded subspaces of certain product spaces (Q952627) (← links)
• Series-parallel chromatic hypergraphs (Q968129) (← links)
• Continuous mappings on subspaces of products with the \( \kappa \)-box topology (Q1032898) (← links)
• Graphs with restricted valency and matching number (Q1043593) (← links)
• Representing \((0,1)\)-matrices by Boolean circuits (Q1045160) (← links)
• Stirling numbers and records (Q1053046) (← links)
• Set systems with three intersections (Q1062054) (← links)
• Perfect measurable spaces (Q1076018) (← links)
• t-expansive and t-wise intersecting hypergraphs (Q1076693) (← links)
• On partially ordered sets embeddable in a free lattice (Q1080440) (← links)
• On subsets of abelian groups with no 3-term arithmetic progression (Q1088718) (← links)
• On the representing number of intersecting families (Q1093635) (← links)
• The monotone circuit complexity of Boolean functions (Q1094870) (← links)
• The maximum number of edges in a 3-graph not containing a given star (Q1095933) (← links)
• Finite projective spaces and intersecting hypergraphs (Q1101456) (← links)
• Decomposition of large combinatorial structures (Q1107544) (← links)
• A Helly property of arcs (Q1109340) (← links)
• Exact solution of some Turán-type problems (Q1112819) (← links)
• Decompositions of partially ordered sets into chains and antichains of given size (Q1115890) (← links)
• On decomposition of hypergraphs into \(\Delta\)-systems (Q1123903) (← links)
• ERCW PRAMs and optical communication (Q1128717) (← links)