The following pages link to On the structure of linear graphs (Q5842850):
Displaying 50 items.
- On low tree-depth decompositions (Q897253) (← links)
- Forbidden subgraphs in the norm graph (Q906463) (← links)
- On the minimum degree forcing \(F\)-free graphs to be (nearly) bipartite (Q932657) (← links)
- The maximum edit distance from hereditary graph properties (Q933672) (← links)
- Spanning 3-colourable subgraphs of small bandwidth in dense graphs (Q933679) (← links)
- A note on the structure of Turán densities of hypergraphs (Q937246) (← links)
- On embedding well-separable graphs (Q941369) (← links)
- Quadripartite version of the Hajnal-Szemerédi theorem (Q941371) (← links)
- Constructions of non-principal families in extremal hypergraph theory (Q941382) (← links)
- Edge-colorings avoiding rainbow and monochromatic subgraphs (Q942100) (← links)
- Generating non-jumping numbers recursively (Q944738) (← links)
- Proof of the bandwidth conjecture of Bollobás and Komlós (Q957895) (← links)
- Packing of graphs with small product of sizes (Q958696) (← links)
- Vertex Turán problems in the hypercube (Q965224) (← links)
- On jumping densities of hypergraphs (Q968206) (← links)
- On finite simple groups and Kneser graphs. (Q968241) (← links)
- The early evolution of the \(H\)-free process (Q982189) (← links)
- Graphic sequences with a realization containing a complete multipartite subgraph (Q998452) (← links)
- Hereditary properties of hypergraphs (Q1003850) (← links)
- Unit distances and diameters in Euclidean spaces (Q1006401) (← links)
- On non-strong jumping numbers and density structures of hypergraphs (Q1043558) (← links)
- Complete \(r\)-partite subgraphs of dense \(r\)-graphs (Q1043950) (← links)
- Separating pairs of points of standard boxes (Q1075327) (← links)
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent (Q1076037) (← links)
- Extremal problems concerning transformations of the set of edges of the complete graph (Q1088678) (← links)
- Hypergraphs do not jump (Q1114711) (← links)
- On a Turán type problem of Erdős (Q1180412) (← links)
- Davenport-Schinzel theory of matrices (Q1195475) (← links)
- Packings of graphs and applications to computational complexity (Q1250227) (← links)
- Induced subgraphs of given sizes (Q1301633) (← links)
- The maximum number of edges in a graph of bounded dimension, with applications to ring theory (Q1301725) (← links)
- An extension of the Erdős-Stone theorem (Q1340136) (← links)
- On the jumping constant conjecture for multigraphs (Q1345881) (← links)
- Blow-up lemma (Q1375060) (← links)
- Tournaments as strong subcontractions (Q1377688) (← links)
- The extremal graph problem of the icosahedron (Q1394239) (← links)
- Extremal graphs for intersecting cliques (Q1417960) (← links)
- On the number of edges not covered by monochromatic copies of a fixed graph. (Q1425108) (← links)
- On the complexity of finite subgraphs of the curve graph (Q1626407) (← links)
- Graphs without theta subgraphs (Q1633744) (← links)
- A note on non-jumping numbers for \(r\)-uniform hypergraphs (Q1637102) (← links)
- Symmetry in Turán sums of squares polynomials from flag algebras (Q1637376) (← links)
- On the Turán number of some ordered even cycles (Q1663800) (← links)
- Stability results for graphs with a critical edge (Q1671746) (← links)
- Some extremal results on complete degenerate hypergraphs (Q1679346) (← links)
- On the local approach to Sidorenko's conjecture (Q1689957) (← links)
- A skew version of the Loebl-Komlós-Sós conjecture (Q1690002) (← links)
- The minimum number of triangles in graphs of given order and size (Q1690017) (← links)
- Degree powers in graphs with a forbidden forest (Q1712530) (← links)
- Edges not in any monochromatic copy of a fixed graph (Q1719571) (← links)
