activity
20112026
most citedOn Turán exponents of bipartite graphs

17 citations · 57 across the 36 of their papers we have counts for

collaborators
Showing 2026 · math.COShow all

8 papers · 2 filters

math.CO2026

An improved minimum degree threshold for fractional clique decompositions in partite graphs

Sean Longbrake, Michael Simkin, Liana Yepremyan +1

We prove a Dirac-type condition for an -partite graph to admit a fractional clique decomposition: every sufficiently large -partite graph with vertices in each part and p…

math.CO2026

A proof of the rational exponents conjecture

David Conlon, Oliver Janzer, Tao Jiang +5

The rational exponents conjecture of Erdős and Simonovits asserts that for every rational there exists a graph such that . We present a pr…

math.CO2026

Generic solutions to symmetric linear equations

Bryce Frederickson, Liana Yepremyan

In 1993, Ruzsa showed that for every , there exists a constant such that every subset of size at least contains distinct elements $…

math.CO2026

Minimal Cayley graphs with large chromatic number

James Davies, Meike Hatzel, Liana Yepremyan

Resolving Babai's minimal Cayley graph problem, we construct finite minimal Cayley graphs with arbitrarily large chromatic number.

math.CO2026

Rational exponents near 3/2

Tao Jiang, Sean Longbrake, Liana Yepremyan

Given a graph , the extremal number is the maximum number of edges in an -vertex graph not containing as a subgraph. The well-known rational exponents conjectur…

math.CO2026

On the generalized Turán number of complete bipartite graphs

Oliver Janzer, Sean Longbrake, Liana Yepremyan

For graphs and , the generalized Turán number denotes the maximum number of copies of in an -free graph on vertices. We prove that if $s\in \…

math.CO2026

On the number of families avoiding a subposet

Tao Jiang, Sean Longbrake, Liana Yepremyan

In this paper we show that for any poset that is not an antichain, the number of induced -free families in the Boolean lattice is at most $ 2^{O(\mathrm{La}^*(n,P)…

math.CO2026

Long cycles in vertex transitive digraphs

Matija Bucić, Kevin Hendrey, Bojan Mohar +2

One of the most well-known conjectures concerning Hamiltonicity in graphs asserts that any sufficiently large connected vertex transitive graph contains a Hamilton cycle. In this f…