Search

Your search keyword '"Volec, Jan"' showing total 145 results

Search Constraints

Start Over You searched for: Author "Volec, Jan" Remove constraint Author: "Volec, Jan"
145 results on '"Volec, Jan"'

Search Results

1. Subgraphs with a positive minimum semidegree in digraphs with large outdegree

2. Tight Hamiltonicity from dense links of triples

3. A tight lower bound on the minimal dispersion

4. Common graphs with arbitrary chromatic number

5. The Spectrum of Triangle-free Graphs

6. The codegree threshold of $K_4^-$

7. Degree conditions forcing directed cycles

8. On tripartite common graphs

9. Towards characterizing locally common graphs

10. Cycles of a given length in tournaments

11. Non-bipartite k-common graphs

12. No additional tournaments are quasirandom-forcing

13. Sharp bounds for decomposing graphs into edges and triangles

14. Characterization of quasirandom permutations by a pattern sum

16. Counterexamples to a conjecture of Harris on Hall ratio

17. Limits of Order Types

18. A bound on the inducibility of cycles

20. Densities of 3-vertex graphs

21. Minimum number of edges that occur in odd cycles

22. Bounded colorings of multipartite graphs and hypergraphs

23. Properly colored and rainbow copies of graphs with few cherries

24. Minimum number of monotone subsequences of length 4 in permutations

25. Rainbow triangles in three-colored graphs

26. Fractional coloring of triangle-free planar graphs

27. A note on acyclic vertex-colorings

28. Compactness and finite forcibility of graphons

29. A problem of Erdos and Sos on 3-graphs

30. Subcubic triangle-free graphs have fractional chromatic number at most 14/5

32. Extensions of Fractional Precolorings show Discontinuous Behavior

33. Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs

34. On the Complexity of Planar Covering of Small Graphs

35. Fractional colorings of cubic graphs with large girth

36. Domination number of cubic graphs with large girth

37. Analytic methods in combinatorics

40. No additional tournaments are quasirandom-forcing?

44. Degree Conditions Forcing Directed Cycles.

49. Toward characterizing locally common graphs.

Catalog

Books, media, physical & digital resources