Showing 1–20 of 84 results
/ Date/ Name
Nov 24, 2020Realizing an m-uniform four-chromatic hypergraph with disksFeb 20, 2010Partitionability to two trees is NP-completeJul 13, 2010Bin Packing via Discrepancy of PermutationsJul 12, 2010Communication ComplexityMay 23, 2011Saturating Sperner familiesJan 3, 2020Turán problems for Edge-ordered graphsJun 11, 2020An improved constant factor for the unit distance problemNov 2, 2020At most $3.55^n$ stable matchingsNov 16, 2021The number of tangencies between two families of curvesAug 18, 2014Forbidden hypermatrices imply general bounds on induced forbidden subposet problemsMar 7, 2012Majority and Plurality ProblemsDec 2, 2016Unified Hanani-Tutte theoremSep 24, 2023Query complexity of Boolean functions on the middle slice of the cubeJul 25, 2017Asymptotics of Pattern Avoidance in the Klazar Set Partition and Permutation-Tuple SettingsSep 10, 2024Piercing intersecting convex setsOct 10, 2022On graphs that contain exactly k copies of a subgraph, and a related problem in search theoryJun 17, 2023Projective and external saturation problem for posetsSep 8, 2023Note on polychromatic coloring of hereditary hypergraph familiesJun 9, 2018Acyclic orientations with degree constraintsDec 11, 2019Colouring bottomless rectangles and arborescences