The following pages link to József Balogh (Q189372):
Displayed 50 items.
- Item:Q189372 (redirect page) (← links)
- Rainbow copies of \(C_4\) in edge-colored hypercubes (Q299042) (← links)
- On the path separation number of graphs (Q313786) (← links)
- A sharp bound on the number of maximal sum-free sets (Q322191) (← links)
- Linear algebra and bootstrap percolation (Q423652) (← links)
- The positive minimum degree game on sparse graphs (Q426781) (← links)
- Almost all triangle-free triple systems are tripartite (Q452822) (← links)
- A random version of Sperner's theorem (Q458289) (← links)
- On the number of \(K_4\)-saturating edges (Q462935) (← links)
- Partitioning 2-edge-colored graphs by monochromatic paths and cycles (Q484546) (← links)
- Recent trends in combinatorics (Q501088) (← links)
- On the Chvàtal-Erdős triangle game (Q540061) (← links)
- Hamilton cycles in random geometric graphs (Q549867) (← links)
- Online Ramsey games for triangles in random graphs (Q607029) (← links)
- The fine structure of octahedron-free graphs (Q631642) (← links)
- The structure of almost all graphs in a hereditary property (Q631643) (← links)
- Large minors in graphs with given independence number (Q641195) (← links)
- The number of \(K_{m,m}\)-free graphs (Q653990) (← links)
- The typical structure of graphs with no large cliques (Q681594) (← links)
- Bootstrap percolation on the hypercube (Q818817) (← links)
- Bootstrap percolation in three dimensions (Q838001) (← links)
- Hereditary properties of partitions, ordered graphs and ordered hypergraphs (Q850077) (← links)
- On the minimal degree implying equality of the largest triangle-free and bipartite subgraphs (Q859617) (← links)
- Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle (Q896063) (← links)
- Item:Q189372 (redirect page) (← links)
- On the bandwidth of 3-dimensional Hamming graphs (Q955026) (← links)
- An extended lower bound on the number of(\(\leqslant k\))-edges to generalized configurations of points and the pseudolinear crossing number of \(K_n\) (Q958731) (← links)
- Minimum difference representations of graphs (Q968207) (← links)
- Hereditary properties of tournaments (Q1010619) (← links)
- Edit distance and its computation (Q1010726) (← links)
- On 2-detour subgraphs of the hypercube (Q1014814) (← links)
- The Erdős-Lovász tihany conjecture for quasi-line graphs (Q1043565) (← links)
- Sharp thresholds in bootstrap percolation (Q1397326) (← links)
- Private computation using a PEZ dispenser. (Q1426438) (← links)
- The number of hypergraphs without linear cycles (Q1633760) (← links)
- Kleitman's conjecture about families of given size minimizing the number of \(k\)-chains (Q1644964) (← links)
- Sharp bound on the number of maximal sum-free subsets of integers (Q1664347) (← links)
- Rainbow spanning trees in properly coloured complete graphs (Q1671318) (← links)
- Two results about the hypercube (Q1671353) (← links)
- Packing chromatic number of cubic graphs (Q1686001) (← links)
- Cubic graphs with small independence ratio (Q1733918) (← links)
- Packing chromatic number of subdivisions of cubic graphs (Q1741592) (← links)
- Long monotone paths in line arrangements (Q1762943) (← links)
- Covering planar graphs with forests (Q1775897) (← links)
- The number of graphs without forbidden subgraphs (Q1826950) (← links)
- Game domination number (Q1849910) (← links)
- The interval number of dense graphs (Q1849949) (← links)
- The speed of hereditary properties of graphs (Q1850473) (← links)
- The Turán density of triple systems is not principal (Q1865388) (← links)
- Large convex holes in random point sets (Q1947987) (← links)