The following pages link to Matija Bucić (Q777482):
Displaying 27 items.
- 2-factors with \(k\) cycles in Hamiltonian graphs (Q777484) (← links)
- An improved bound for disjoint directed cycles (Q1637139) (← links)
- Monochromatic paths in random tournaments (Q1689907) (← links)
- (Q2000652) (redirect page) (← links)
- Partition problems in high dimensional boxes (Q2000653) (← links)
- Tournament quasirandomness from local counting (Q2036620) (← links)
- Covering graphs by monochromatic trees and Helly-type results for hypergraphs (Q2043761) (← links)
- Multicolour bipartite Ramsey number of paths (Q2325761) (← links)
- 3‐Color bipartite Ramsey number of cycles and paths (Q3299216) (← links)
- Large cliques and independent sets all over the place (Q4992901) (← links)
- Monochromatic trees in random tournaments (Q4993096) (← links)
- Counting <i>H</i>-free orientations of graphs (Q5058452) (← links)
- Turán numbers of sunflowers (Q5060342) (← links)
- Cycles of many lengths in Hamiltonian graphs (Q5102252) (← links)
- Halfway to Rota’s Basis Conjecture (Q5853702) (← links)
- Universal and unavoidable graphs (Q5886120) (← links)
- Directed Ramsey number for trees (Q5915808) (← links)
- The intersection spectrum of 3‐chromatic intersecting hypergraphs (Q6051524) (← links)
- List Ramsey numbers (Q6055384) (← links)
- Perfect matchings and derangements on graphs (Q6055945) (← links)
- Clique minors in graphs with a forbidden subgraph (Q6074687) (← links)
- Covering random graphs with monochromatic trees (Q6074874) (← links)
- Large independent sets from local considerations (Q6081381) (← links)
- The (t−1) $(t-1)$‐chromatic Ramsey number for paths (Q6094047) (← links)
- Uniform Turán density of cycles (Q6112889) (← links)
- Towards the Erdős-Hajnal conjecture for \(P_5\)-free graphs (Q6138779) (← links)
- Tight Ramsey bounds for multiple copies of a graph (Q6376090) (← links)
