Oleg Pikhurko

From MaRDI portal
Revision as of 08:20, 25 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:228798

Available identifiers

zbMath Open pikhurko.olegMaRDI QIDQ228798

List of research outcomes

PublicationDate of PublicationType
On the limit of the positive \(\ell\)-degree Turán problem2024-02-23Paper
Exact solutions to the Erdős-Rothschild problem2024-01-18Paper
A note on extremal constructions for the Erd\H{o}s--Rademacher problem2023-11-30Paper
Large deviation principles for graphon sampling2023-11-11Paper
Stability from graph symmetrisation arguments with applications to inducibility2023-09-15Paper
The codegree threshold of \(K_4^-\)2023-08-23Paper
Local version of Vizing's theorem for multi-graphs2023-06-07Paper
Hypergraph Turán densities can have arbitrarily large algebraic degree2023-05-02Paper
Disjoint isomorphic balanced clique subdivisions2023-05-02Paper
Stability for the Erdős-Rothschild problem2023-04-17Paper
Forcing Generalized Quasirandom Graphs Efficiently2023-03-07Paper
On a question of Vera T. Sós about size forcing of graphons2023-01-23Paper
Finite Hypergraph Families with Rich Extremal Tur\'an Constructions via Mixing Patterns2022-12-16Paper
Borel Combinatorics of Locally Finite Graphs2022-11-18Paper
Measurable equidecompositions for group actions with an expansion property2022-11-17Paper
On the $(6,4)$-problem of Brown, Erd\H{o}s and S\'os2022-09-28Paper
Circle Squaring with Pieces of Small Boundary and Low Borel Complexity2022-02-03Paper
New lower bounds on kissing numbers and spherical codes in high dimensions2021-11-01Paper
Sharp bounds for decomposing graphs into edges and triangles2021-06-15Paper
Stability for the Erd\H{o}s-Rothschild problem2021-05-20Paper
On a question of Vera T. S\'os about size forcing of graphons2021-03-16Paper
Large Deviation Principles for Block and Step Graphon Random Graph Models2021-01-18Paper
Asymptotic Structure for the Clique Density Theorem2021-01-16Paper
Divisibility of Spheres with Measurable Pieces2020-12-09Paper
Measurable versions of Vizing's theorem2020-10-08Paper
Supersaturation problem for the bowtie2020-06-16Paper
Isometric copies of directed trees in orientations of graphs2020-05-21Paper
THE EXACT MINIMUM NUMBER OF TRIANGLES IN GRAPHS WITH GIVEN ORDER AND SIZE2020-05-04Paper
Minimizing the number of 5-cycles in graphs with given edge-density2020-04-06Paper
Minimum number of additive tuples in groups of prime order2019-03-05Paper
Edges not in any monochromatic copy of a fixed graph2019-02-08Paper
Strong forms of stability from flag algebra calculations2019-02-08Paper
How unproportional must a graph be?2018-08-24Paper
Supersaturation problem for the bowtie2018-01-18Paper
The codegree threshold of \(K_4^-\)2018-01-18Paper
The minimum number of triangles in graphs of given order and size2018-01-18Paper
Asymptotic Structure of Graphs with the Minimum Number of Triangles2017-10-10Paper
Minimum Number of Monotone Subsequences of Length 4 in Permutations2017-10-04Paper
The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques2017-09-28Paper
Measurable circle squaring2017-04-05Paper
KŐNIG’S LINE COLORING AND VIZING’S THEOREMS FOR GRAPHINGS2017-04-04Paper
Supersaturation problem for color-critical graphs2017-01-26Paper
https://portal.mardi4nfdi.de/entity/Q28161312016-07-01Paper
Monochromatic Clique Decompositions of Graphs2016-02-01Paper
Measurable equidecompositions for group actions with an expansion property2016-01-12Paper
The maximal length of a gap between \(r\)-graph Turán densities2015-11-02Paper
The Codegree Threshold for 3-Graphs with Independent Neighborhoods2015-09-02Paper
How to Play Dundee2015-08-26Paper
Poset limits can be totally ordered2015-04-22Paper
Coloring \(d\)-embeddable \(k\)-uniform hypergraphs2015-02-03Paper
Martin Gardner’s Minimum No-3-in-a-Line Problem2014-11-10Paper
On possible Turán densities2014-10-24Paper
Measurable equidecompositions via combinatorics and group theory2014-08-08Paper
https://portal.mardi4nfdi.de/entity/Q54199872014-06-11Paper
Minimum Number ofk-Cliques in Graphs with Bounded Independence Number2014-02-24Paper
On minimum saturated matrices2013-09-26Paper
A note on the Turán function of even cycles2013-09-03Paper
Primality of trees2013-07-30Paper
Quasirandom permutations are characterized by 4-point densities2013-06-25Paper
Exact computation of the hypergraph Turán function for expanded complete 2-graphs2013-04-17Paper
The maximum number of K 3 -free and K 4 -free edge 4-colorings2012-06-08Paper
Logical complexity of graphs: a survey2012-03-02Paper
Hypergraphs with independent neighborhoods2011-12-19Paper
The minimum size of 3-graphs without a 4-set spanning no or exactly three edges2011-11-29Paper
Set Systems without a Strong Simplex2011-06-17Paper
Flips in Graphs2011-06-17Paper
The saturation function of complete partite graphs2011-06-14Paper
Untangling planar graphs from a specified vertex position-Hard cases2011-05-17Paper
Maximizing the number of q -colorings2010-11-26Paper
An analytic approach to stability2010-10-19Paper
https://portal.mardi4nfdi.de/entity/Q35766542010-07-30Paper
Memoryless Rules for Achlioptas Processes2010-06-01Paper
Finding an Unknown Acyclic Orientation of a Given Graph2010-04-23Paper
Anti-Ramsey properties of random graphs2010-04-21Paper
Anti-Ramsey numbers of doubly edge-critical graphs2009-12-18Paper
The maximum size of hypergraphs without generalized 4-cycles2009-06-17Paper
Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree2009-04-29Paper
Quadruple systems with independent neighborhoods2008-12-08Paper
Game chromatic index of graphs with given restrictions on degrees2008-11-18Paper
An exact Turán result for the generalized triangle2008-10-21Paper
Constructions of non-principal families in extremal hypergraph theory2008-09-04Paper
https://portal.mardi4nfdi.de/entity/Q35171582008-08-12Paper
Odd and even cycles in maker-breaker games2008-04-22Paper
Characterization of product anti-magic graphs of large order2008-03-14Paper
https://portal.mardi4nfdi.de/entity/Q54491592008-03-11Paper
Maximum acyclic and fragmented sets in regular graphs2008-02-13Paper
Generating Edge-Labeled Trees2008-02-05Paper
Maximum number of colorings of (2k, k2)‐graphs2008-01-04Paper
Decomposable graphs and definitions with no quantifier alternation2007-11-21Paper
Minimum \(H\)-decompositions of graphs2007-10-10Paper
Product rule wins a competitive game2007-07-27Paper
A new generalization of Mantel's theorem to \(k\)-graphs2007-06-08Paper
Size Ramsey Numbers and Integer Programming2007-05-29Paper
First-Order Definability of Trees and Sparse Random Graphs2007-05-15Paper
Trees are almost prime2007-04-26Paper
https://portal.mardi4nfdi.de/entity/Q34256632007-03-01Paper
The first order definability of graphs: Upper bounds for quantifier depth2007-01-09Paper
Edge-bandwidth of grids and tori2007-01-09Paper
Dense edge-magic graphs and thin additive bases2006-09-14Paper
4-books of three pages2006-08-04Paper
Bounds on the generalised acyclic chromatic numbers of bounded degree graphs2006-06-16Paper
Maximum \(K_{r+1}\)-free graphs which are not \(r\)-partite.2006-05-24Paper
Succinct definitions in the first order theory of graphs2006-04-28Paper
Degree sequences of \(F\)-free graphs2006-01-17Paper
Descriptive complexity of finite structures: Saving the quantifier rank2006-01-16Paper
The Game of JumbleG2005-11-14Paper
On Triple Systems with Independent Neighbourhoods2005-11-14Paper
https://portal.mardi4nfdi.de/entity/Q54634842005-08-04Paper
Integer sets with prescribed pairwise differences being distinct2005-05-04Paper
How complex are random graphs in first order logic?2005-04-21Paper
https://portal.mardi4nfdi.de/entity/Q46655342005-04-11Paper
Biased positional games on matroids2005-02-23Paper
https://portal.mardi4nfdi.de/entity/Q48314712005-01-03Paper
Remarks on a paper by H. Bielak on size Ramsey numbers2004-09-08Paper
Optimizers for Sub-Sums subject to a Sum- and a Schur-Convex Constraint with Applications to Estimation of Eigenvalues2004-05-18Paper
Asymptotic Size Ramsey Results for Bipartite Graphs2004-01-08Paper
Further asymptotic size Ramsey results obtained via linear programming2004-01-05Paper
Lattice points in lattice polytopes2003-11-16Paper
On the cofinality of infinite partially ordered sets: Factoring a poset into lean essential subsets2003-08-21Paper
The Turán density of the hypergraph \(\{abc,ade,bde,cde\}\)2003-05-07Paper
Size ramsey numbers of stars versus 4‐chromatic graphs2003-04-03Paper
https://portal.mardi4nfdi.de/entity/Q47958962003-02-26Paper
Weakly Saturated Hypergraphs and Exterior Algebra2002-09-17Paper
Uniform families and count matroids2002-06-19Paper
Disjoint subgraphs of large maximum degree2002-05-28Paper
Size Ramsey numbers of stars versus 3-chromatic graphs2002-02-13Paper
Borsuk's Conjecture Fails in Dimensions 321 and 3222002-02-12Paper
On Envy-Free Cake Division2001-11-26Paper
https://portal.mardi4nfdi.de/entity/Q27133592001-10-21Paper
Remarks on a Paper by Y.Caro and R.Yuster on Turan Problem2001-01-29Paper
Operators Extending (Pseudo-)Metrics2000-12-12Paper
On edge decompositions of posets2000-09-04Paper
Foata's Bijection for Tree-Like Structures2000-07-25Paper
Asymptotic evaluation of the sat-function for \(r\)-stars2000-03-23Paper
The Minimum Size of Saturated Hypergraphs2000-01-30Paper
Extending metrics in compact pairs1999-11-22Paper
Enumeration of labelled \((k,m)\)-trees1999-08-19Paper
https://portal.mardi4nfdi.de/entity/Q43834071998-04-01Paper
Lifting functors to Eilenberg-Moore category of monad generated by functor CpCp1993-08-30Paper
Lifting functors to Eilenberg-Moore category of monad generated by functor CpCp1992-01-01Paper
Borel version of the Local Lemma0001-01-03Paper
Divisibility of Spheres with Measurable Pieces0001-01-03Paper
Moser-Tardos Algorithm with small number of random bits0001-01-03Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Oleg Pikhurko