Prohlížení Publikační činnost ČVUT dle autora "Lidický B."
-
Counterexamples to a Conjecture of Harris on Hall Ratio
Autor: Blumenthal A.; Lidický B.; Martin R.R.; Norin S.; Pfender F.; Volec J.
(SIAM, 2022)In this work, we refute a conjecture of Harris by constructing various graphs whose fractional chromatic number grows much faster than their Hall ratio. The Hall ratio of a graph G is the maximum value of the ratio between ... -
Large Multipartite Subgraphs in H-free Graphs
Autor: Hu P.; Lidický B.; Martins T.; Norin S.; Volec J.
(Springer Nature Switzerland AG, 2021)In this work, we discuss a strengthening of a result of Füredi that every n-vertex K_{r+1}-free graph can be made r-partite by removing at most T(n, r) - e(G) edges, where T(n,r)=(r-1)/(2r) * n^2 denotes the number of edges ... -
On tripartite common graphs
Autor: Grzesik A.; Lee J.; Lidický B.; Volec J.
(Cambridge University Press, 2022)This work provides several new classes of tripartite common graphs. A graph H is common if the number of monochromatic copies of H in a 2-edge-colouring of the complete graph K-n is asymptotically minimised by the random ... -
Sharp bounds for decomposing graphs into edges and triangles
Autor: Blumenthal A.; Lidický B.; Pehova Y.; Pfender F.; Pikhurko O.; Volec J.
(Cambridge University Press, 2021)In 1966, Erdos, Goodman and Posa proved that the edges of an n-vertex graph can be decomposed into at most n^2/4 cliques. Moreover, such a decomposition may consist of edges and triangles only. In 1980s, Gyori and Kostochka ... -
THE SPECTRUM OF TRIANGLE-FREE GRAPHS
Autor: Balogh J.; Clemen F.; Lidický B.; Norin S.; Volec J.
(SIAM, 2023)Denote by q_n(G) the smallest eigenvalue of the signless Laplacian matrix of an n vertex graph G. Brandt conjectured in 1997 that for regular triangle-free graphs q_n(G)<= 4n/25. We prove a stronger result: If G is a ...