The following pages link to Oleg Pikhurko (Q228798):
Displaying 50 items.
- Primality of trees (Q357453) (← links)
- On minimum saturated matrices (Q367048) (← links)
- On possible Turán densities (Q466081) (← links)
- Supersaturation problem for color-critical graphs (Q505915) (← links)
- Measurable circle squaring (Q519656) (← links)
- Untangling planar graphs from a specified vertex position-Hard cases (Q534342) (← links)
- The saturation function of complete partite graphs (Q543991) (← links)
- The minimum size of 3-graphs without a 4-set spanning no or exactly three edges (Q648971) (← links)
- Hypergraphs with independent neighborhoods (Q653790) (← links)
- Minimum number of additive tuples in groups of prime order (Q668091) (← links)
- An analytic approach to stability (Q710597) (← links)
- The first order definability of graphs: Upper bounds for quantifier depth (Q860411) (← links)
- Edge-bandwidth of grids and tori (Q861250) (← links)
- Trees are almost prime (Q878641) (← links)
- A new generalization of Mantel's theorem to \(k\)-graphs (Q885302) (← links)
- The maximal length of a gap between \(r\)-graph Turán densities (Q888628) (← links)
- Constructions of non-principal families in extremal hypergraph theory (Q941382) (← links)
- An exact Turán result for the generalized triangle (Q949792) (← links)
- Game chromatic index of graphs with given restrictions on degrees (Q954995) (← links)
- Quadruple systems with independent neighborhoods (Q958757) (← links)
- Anti-Ramsey properties of random graphs (Q965256) (← links)
- Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree (Q1014811) (← links)
- The maximum size of hypergraphs without generalized 4-cycles (Q1024366) (← links)
- Enumeration of labelled \((k,m)\)-trees (Q1284483) (← links)
- Extending metrics in compact pairs (Q1308362) (← links)
- On the cofinality of infinite partially ordered sets: Factoring a poset into lean essential subsets (Q1404380) (← links)
- Further asymptotic size Ramsey results obtained via linear programming (Q1417577) (← links)
- On edge decompositions of posets (Q1577313) (← links)
- Disjoint subgraphs of large maximum degree (Q1598819) (← links)
- How unproportional must a graph be? (Q1663804) (← links)
- The codegree threshold of \(K_4^-\) (Q1689950) (← links)
- The minimum number of triangles in graphs of given order and size (Q1690017) (← links)
- Edges not in any monochromatic copy of a fixed graph (Q1719571) (← links)
- Strong forms of stability from flag algebra calculations (Q1719577) (← links)
- Biased positional games on matroids (Q1765611) (← links)
- Integer sets with prescribed pairwise differences being distinct (Q1775027) (← links)
- The Turán density of the hypergraph \(\{abc,ade,bde,cde\}\) (Q1871383) (← links)
- Remarks on a paper by H. Bielak on size Ramsey numbers (Q1878804) (← links)
- Exact computation of the hypergraph Turán function for expanded complete 2-graphs (Q1945994) (← links)
- Asymptotic evaluation of the sat-function for \(r\)-stars (Q1972152) (← links)
- Measurable versions of Vizing's theorem (Q2006081) (← links)
- Measurable equidecompositions for group actions with an expansion property (Q2098198) (← links)
- Succinct definitions in the first order theory of graphs (Q2368907) (← links)
- Quasirandom permutations are characterized by 4-point densities (Q2375768) (← links)
- Minimum \(H\)-decompositions of graphs (Q2384810) (← links)
- Odd and even cycles in maker-breaker games (Q2426453) (← links)
- Decomposable graphs and definitions with no quantifier alternation (Q2461780) (← links)
- Characterization of product anti-magic graphs of large order (Q2478164) (← links)
- Maximum \(K_{r+1}\)-free graphs which are not \(r\)-partite. (Q2488527) (← links)
- Bounds on the generalised acyclic chromatic numbers of bounded degree graphs (Q2494116) (← links)
