activity
20112021
most citedPosets with cover graph of pathwidth two have bounded dimension

11 citations · 20 across the 8 of their papers we have counts for

collaborators

10 papers

math.CO2021★ 1 cited

Dimension bounds on classes of interval orders with restricted representation

Csaba Biro, Sida Wan

In general, representations of interval orders may use an arbitrary set of interval lengths. We can define subclasses of interval orders by restricting the allowable lengths of int…

math.CO2014★ 1 cited

An upper bound on the extremal version of Hajnal's triangle-free game

Csaba Biró, Paul Horn, D. Jacob Wildstrom

A game starts with the empty graph on vertices, and two player alternate adding edges to the graph. Only moves which do not create a triangle are valid. The game ends when a ma…

math.CO2014★ 1 cited

Forcing Posets with Large Dimension to Contain Large Standard Examples

Csaba Biró, Peter Hamburger, Attila Pór +1

The dimension of a poset , denoted , is the least positive integer for which is the intersection of linear extensions of . The maximum dimension of a pos…

math.CO2014

The proof of the removable pair conjecture for fractional dimension

Csaba Biró, Peter Hamburger, Attila Pór

In 1971 Trotter conjectured that every finite poset on at least points has a pair whose removal does not decrease the dimension by more than . In 1992 Brightwell and Scheine…

math.CO2013

Standard Examples as Subposets of Posets

Csaba Biro, Peter Hamburger, Attila Por

We prove that a poset with no induced subposet (for fixed ) must have dimension that is sublinear in terms of the number of elements.

math.CO2013★ 11 cited

Posets with cover graph of pathwidth two have bounded dimension

Csaba Biró, Mitchel T. Keller, Stephen J. Young

Joret, Micek, Milans, Trotter, Walczak, and Wang recently asked if there exists a constant such that if is a poset with cover graph of of pathwidth at most , then $\…

math.CO2012

The rate of growth of the minimum clique size of graphs of given order and chromatic number

Csaba Biró, Kris Wease

Let denote the minimum clique number over graphs with vertices and chromatic number . We determine the rate of growth of of the sequence ${Q(n,\lceil rn \rceil)}_{n…

math.CO2012

Generating infinite random graphs

Csaba Biró, Udayan B. Darji

We define a growing model of random graphs. Given a sequence of nonnegative integers with the property that , we construct a random graph on count…

math.CO2011★ 4 cited

Large cliques in graphs with high chromatic number

Csaba Biró

We study graphs whose chromatic number is close to the order of the graph (the number of vertices). Both when the chromatic number is a constant multiple of the order and when the…

math.CO2011★ 2 cited

Large chromatic number and Ramsey graphs

Csaba Biró, Zoltán Füredi, Sogol Jahanbekam

Let Q(n,c) denote the minimum clique size an n-vertex graph can have if its chromatic number is c. Using Ramsey graphs we give an exact, albeit implicit, formula for the case c is…