4 papers
Maximum Forest Number of General Bipartite Graphs: Structural and Complexity Results
Daniel IľkoviÄ
Recent results established the maximum forest number for balanced bipartite graphs under Ore-type degree sum conditions. In this paper, we extend these results by determinin…
Distribution of independent sets in perfect -ary trees
Daniel IľkoviÄ, Jun Yan
Given a graph , the family of all independent sets of size containing a fixed vertex is called a star with centre , and is denoted by . Motivated…
An improved hypergraph Mantel's Theorem
Daniel IľkoviÄ, Jun Yan
In a recent paper, Chao and Yu used an entropy method to show that the Turán density of a certain family of triangle-like -uniform hypergraph…
Multi-cyclic graphs in the random graph process with restricted budget
Daniel IľkoviÄ, Jared León, Xichao Shu
We study a controlled random graph process introduced by Frieze, Krivelevich, and Michaeli. In this model, the edges of a complete graph are randomly ordered and revealed sequentia…