The following pages link to Daniel Král' (Q273100):
Displaying 28 items.
- Circular edge-colorings of cubic graphs with girth six (Q5900963) (← links)
- On planar mixed hypergraphs (Q5948492) (← links)
- Quasirandom-Forcing Orientations of Cycles (Q6071821) (← links)
- Quasirandom Latin squares (Q6076738) (← links)
- Toward characterizing locally common graphs (Q6077054) (← links)
- Uniform Turán density of cycles (Q6112889) (← links)
- Three-coloring triangle-free graphs on surfaces. VI: 3-colorability of quadrangulations (Q6184892) (← links)
- Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs (Q6251001) (← links)
- Recovering sparse graphs (Q6291909) (← links)
- Non-bipartite k-common graphs (Q6343067) (← links)
- Extensions of fractional precolorings show discontinuous behavior (Q6486791) (← links)
- Strong modeling limits of graphs with bounded tree-width (Q6505074) (← links)
- Common graphs with arbitrary chromatic number (Q6506057) (← links)
- Twin-width of graphs on surfaces (Q6511026) (← links)
- The dimension of the feasible region of pattern densities (Q6513095) (← links)
- Branch-depth is minor closure of contraction-deletion-depth (Q6523353) (← links)
- Ramsey multiplicity of apices of trees (Q6527335) (← links)
- Characterization of matrices with bounded graver bases and depth parameters and applications to integer programming (Q6560815) (← links)
- Hypergraphs with minimum positive uniform Turán density (Q6604687) (← links)
- Planar graph with twin-width seven (Q6614402) (← links)
- Cycles of length three and four in tournaments (Q6621178) (← links)
- More non-bipartite forcing pairs (Q6621222) (← links)
- Forcing generalised quasirandom graphs efficiently (Q6632790) (← links)
- Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming (Q6634533) (← links)
- Hypergraphs with uniform Turán density equal to 8/27 (Q6735617) (← links)
- Forcing quasirandomness with 4-point permutations (Q6735818) (← links)
- Four-coloring Eulerian triangulations of the torus (Q6746460) (← links)
- Curves on the torus with few intersections (Q6759615) (← links)
