István Tomon

activity

20142026

most citedOn the Turán number of some ordered even cycles

10 citations · 38 across the 54 of their papers we have counts for

collaborators

Showing 2015Show all

2 papers · 1 filter

math.CO2015★ 2 cited

The poset on connected graphs is Sperner

Stephen G. Z. Smith, István Tomon

Let $G$ be the set of all connected graphs on vertex set $[n]$ . Define the partial ordering $<$ on $G$ as follows: for $G, H \in G$ let $G < H$ if $E(G)\s…

math.CO2015

Decompositions of the Boolean lattice into rank-symmetric chains

Istvan Tomon

The Boolean lattice $2^{[n]}$ is the power set of $[n]$ ordered by inclusion. A chain $c_{0} \subset ... \subset c_{k}$ in $2^{[n]}$ is rank-symmetric, if $∣ c_{i} ∣ + ∣ c_{k - i} ∣ = n$ for $i…