The following pages link to Jan Hladký (Q256343):
Displaying 50 items.
- The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs (Q256345) (← links)
- An approximate version of the tree packing conjecture (Q273108) (← links)
- Detecting tampering in a random hypercube (Q388876) (← links)
- The extremal function for partial bipartite tilings (Q412273) (← links)
- Cover time of a random graph with given degree sequence (Q456654) (← links)
- Hamilton cycles in dense vertex-transitive graphs (Q462925) (← links)
- An extension of Turán's theorem, uniqueness and stability (Q463041) (← links)
- Chromatic roots and limits of dense graphs (Q512616) (← links)
- Brooks' theorem via the Alon-Tarsi theorem (Q712277) (← links)
- An engine breaking the \(\Omega\)EP-property (Q860497) (← links)
- Loebl-Komlós-Sós conjecture: dense case (Q895997) (← links)
- First steps in combinatorial optimization on graphons: matchings (Q1689941) (← links)
- On the number of pentagons in triangle-free graphs (Q1940382) (← links)
- A Turán-type theorem for large-distance graphs in Euclidean spaces, and related isodiametric problems (Q2039318) (← links)
- Two remarks on graph norms (Q2118224) (← links)
- Cut distance identifying graphon parameters over weak* limits (Q2120830) (← links)
- Independent sets, cliques, and colorings in graphons (Q2189827) (← links)
- Relating the cut distance and the weak* topology for graphons (Q2222051) (← links)
- Tilings in graphons (Q2225467) (← links)
- Matching polytons (Q2278115) (← links)
- Cut-norm and entropy minimization over \(\text{weak}^{\ast}\) limits (Q2312609) (← links)
- Rank of divisors on tropical curves (Q2349185) (← links)
- Upper bound theorem for odd-dimensional flag triangulations of manifolds (Q2827923) (← links)
- Minimum degree conditions for large subgraphs (Q2851441) (← links)
- Loebl-Komlós-Sós conjecture: dense case (Q2851529) (← links)
- Euler's idoneal numbers and an inequality concerning minimal graphs with a prescribed number of spanning trees. (Q2856915) (← links)
- A density Corrádi-Hajnal theorem (Q2857315) (← links)
- A proof of the dense version of Lovász conjecture (Q2857360) (← links)
- Vertex distinguishing edge- and total-colorings of Cartesian and other product graphs. (Q2864442) (← links)
- On minimal energy of bipartite unicyclic graphs of a given bipartition. (Q2864446) (← links)
- Non-three-colourable common graphs exist (Q2911071) (← links)
- Two families of lattices. (Q2918558) (← links)
- An Approximate Version of the Tree Packing Conjecture via Random Embeddings (Q2969640) (← links)
- A combinatorial proof of Rayleigh monotonicity for graphs (Q3462416) (← links)
- List colorings with measurable sets (Q3605151) (← links)
- Poset limits can be totally ordered (Q5247001) (← links)
- The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition (Q5267992) (← links)
- The Approximate Loebl--Komlós--Sós Conjecture II: The Rough Structure of LKS Graphs (Q5267993) (← links)
- The Approximate Loebl--Komlós--Sós Conjecture III: The Finer Structure of LKS Graphs (Q5267994) (← links)
- The Approximate Loebl--Komlós--Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result (Q5267995) (← links)
- Cliques in dense inhomogeneous random graphs (Q5357981) (← links)
- Komlós's tiling theorem via graphon covers (Q5379813) (← links)
- Note on Bipartite Graph Tilings (Q5392896) (← links)
- Dense flag triangulations of 3-manifolds via extremal graph theory (Q5496677) (← links)
- The tripartite Ramsey number for trees (Q5891229) (← links)
- Counting flags in triangle-free digraphs (Q5891231) (← links)
- A limit theorem for small cliques in inhomogeneous random graphs (Q6080866) (← links)
- Approximating fractionally isomorphic graphons (Q6115784) (← links)
- Prominent examples of flip processes (Q6201039) (← links)
- The approximate Loebl-Koml\'os-S\'os Conjecture (Q6237128) (← links)
