S. Boyadzhiyska

most citedA Simple Proof Characterizing Interval Orders with Interval Lengths between 1 and

k

2 citations · 2 across the 2 of their papers we have counts for

collaborators

3 papers

math.CO2026

The density of graphs with no $ℓ$ -path connecting equal-degree vertices: a short proof

Yamaan Attwa, Matías Azócar Carvajal, Simona Boyadzhiyska +2

Addressing a question posed by Chen and Ma from an asymptotic point of view, we present a short proof for the edge density needed to guarantee that two vertices of the same degree…

math.CO2017★ 2 cited

A Simple Proof Characterizing Interval Orders with Interval Lengths between 1 and $k$

Simona Boyadzhiyska, Garth Isaak, Ann Trenk

A poset $P = (X, ≺)$ has an interval representation if each $x \in X$ can be assigned a real interval $I_{x}$ so that $x ≺ y$ in $P$ if and only if $I_{x}$ lies completely to th…

math.CO2017

Interval Orders with Two Interval Lengths

Simona Boyadzhiyska, Garth Isaak, Ann N Trenk

A poset $P = (X, ≺)$ has an interval representation if each $x \in X$ can be assigned a real interval $I_{x}$ so that $x ≺ y$ in $P$ if and only if $I_{x}$ lies completely to th…

The density of graphs with no ℓ-path connecting equal-degree vertices: a short proof

A Simple Proof Characterizing Interval Orders with Interval Lengths between 1 and k

Interval Orders with Two Interval Lengths

The density of graphs with no $ℓ$ -path connecting equal-degree vertices: a short proof

A Simple Proof Characterizing Interval Orders with Interval Lengths between 1 and $k$