The following pages link to István Tomon (Q501072):
Displayed 50 items.
- Improved bounds on the partitioning of the Boolean lattice into chains of equal size. (Q501073) (← links)
- On the chromatic number of disjointness graphs of curves (Q777485) (← links)
- Partitioning the Boolean lattice into copies of a poset (Q1621412) (← links)
- Forbidden induced subposets of given height (Q1621436) (← links)
- On the Turán number of some ordered even cycles (Q1663800) (← links)
- The multiplication table problem for bipartite graphs (Q1669691) (← links)
- Tiling the Boolean lattice with copies of a poset (Q1689970) (← links)
- Almost tiling of the Boolean lattice with copies of a poset (Q1700806) (← links)
- Erdős-Hajnal-type results for monotone paths (Q1984509) (← links)
- Flattening rank and its combinatorial applications (Q2032245) (← links)
- A sharp threshold phenomenon in string graphs (Q2066317) (← links)
- Infinite Sperner's theorem (Q2068601) (← links)
- Coloring Hasse diagrams and disjointness graphs of curves (Q2206854) (← links)
- Colorings with only rainbow arithmetic progressions (Q2220973) (← links)
- Ordered graphs and large bi-cliques in intersection graphs of curves (Q2323249) (← links)
- On the chromatic number of regular graphs of matrix algebras (Q2347358) (← links)
- On a conjecture of Füredi. (Q2349954) (← links)
- Point sets with every triangle having a large angle (Q2354520) (← links)
- The poset on connected graphs is Sperner (Q2397104) (← links)
- On the number of occurrences of the \(k\)th smallest distance between points in convex position (Q2407030) (← links)
- On the size of $K$-cross-free families (Q2416517) (← links)
- Ramsey graphs induce subgraphs of many different sizes (Q2416519) (← links)
- Turán-type results for complete \(h\)-partite graphs in comparability and incomparability graphs (Q2520724) (← links)
- Decompositions of the Boolean lattice into rank-symmetric chains. (Q2629495) (← links)
- Bipartite Turán problems for ordered graphs (Q2678460) (← links)
- Packing the Boolean lattice with copies of a poset (Q3296748) (← links)
- Induced Subgraphs With Many Distinct Degrees (Q4601057) (← links)
- Improved Ramsey-type results for comparability graphs (Q4987258) (← links)
- Hasse diagrams with large chromatic number (Q5006387) (← links)
- Ramsey properties of algebraic graphs and hypergraphs (Q5044389) (← links)
- Polynomial removal lemmas for ordered graphs (Q5051460) (← links)
- The Extremal Number of Tight Cycles (Q5088633) (← links)
- (Q5088986) (← links)
- The Extremal Number of Surfaces (Q5102299) (← links)
- Turán number of bipartite graphs with no 𝐾_{𝑡,𝑡} (Q5111494) (← links)
- Large Homogeneous Submatrices (Q5855527) (← links)
- Turán-type results for intersection graphs of boxes (Q5886122) (← links)
- On the Turán number of ordered forests (Q5915827) (← links)
- On the Turán number of ordered forests (Q5920232) (← links)
- Ramsey numbers of semi-algebraic and semi-linear hypergraphs (Q6051048) (← links)
- On 3‐graphs with no four vertices spanning exactly two edges (Q6051388) (← links)
- Uniform chain decompositions and applications (Q6074684) (← links)
- Tiling with Monotone Polyominos (Q6144634) (← links)
- Ramsey properties of semilinear graphs (Q6161733) (← links)
- The Turán number of the grid (Q6176592) (← links)
- Lower bounds for piercing and coloring boxes (Q6187716) (← links)
- String graphs have the Erdős-Hajnal property (Q6192228) (← links)
- Coloring lines and Delaunay graphs with respect to boxes (Q6201036) (← links)
- Forbidden induced subposets in the grid (Q6287155) (← links)
- Bipartite Tur\'an problems for ordered graphs (Q6323401) (← links)