The following pages link to (Q3312262):
Displaying 39 items.
- Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded (Q512562) (← links)
- Topological minors in bipartite graphs (Q644636) (← links)
- Excluding induced subgraphs. II: Extremal graphs (Q686271) (← links)
- New families of graphs without short cycles and large size (Q708348) (← links)
- Extremal problems whose solutions are the blowups of the small Witt- designs (Q807640) (← links)
- On invariants of hereditary graph properties (Q868369) (← links)
- On the minimum degree forcing \(F\)-free graphs to be (nearly) bipartite (Q932657) (← links)
- On the homogeneous algebraic graphs of large girth and their applications (Q1006033) (← links)
- Calculating the extremal number \(ex(v;\{C_3,C_4,\dots,C_n\})\) (Q1026123) (← links)
- Extremal theory and bipartite graph-tree Ramsey numbers (Q1112065) (← links)
- On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs (Q1123216) (← links)
- Turán theorems with repeated degrees (Q1198646) (← links)
- Polarities and \(2k\)-cycle-free graphs (Q1292856) (← links)
- Induced subgraphs of given sizes (Q1301633) (← links)
- Extremal problems and generalized degrees (Q1322223) (← links)
- Problems and results in discrete mathematics (Q1344612) (← links)
- Ramsey numbers involving large dense graphs and bipartite Turán numbers (Q1405120) (← links)
- Extremal problems for sets forming Boolean algebras and complete partite hypergraphs (Q1818218) (← links)
- The number of graphs without forbidden subgraphs (Q1826950) (← links)
- Large generalized books are \(p\)-good (Q1880791) (← links)
- Explicit construction of graphs with an arbitrary large girth and of large size (Q1894370) (← links)
- On product representation of powers. I (Q1902964) (← links)
- Zero-sum problems -- a survey (Q1917486) (← links)
- On the comparison of cryptographical properties of two different families of graphs with large cycle indicator (Q1949050) (← links)
- Cut and pendant vertices and the number of connected induced subgraphs of a graph (Q2040982) (← links)
- On lower bounds for the chromatic number in terms of vertex degree (Q2275368) (← links)
- Boundedness of optimal matrices in extremal multigraph and digraph problems (Q2367447) (← links)
- The implementation of cubic public keys based on a new family of algebraic graphs (Q2442946) (← links)
- On monomial graphs of girth eight (Q2467318) (← links)
- A hierarchy of randomness for graphs (Q2576864) (← links)
- On Extremal Graphs with Bounded Girth (Q2851535) (← links)
- On Multivariate Cryptosystems Based on Computable Maps with Invertible Decomposition (Q2960378) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Algorithmic Solution of Extremal Digraph Problems (Q3745867) (← links)
- Inequalities in probability theory and turán-type problems for graphs with colored vertices (Q3970903) (← links)
- Extremal Graph Problems for Graphs with a Color-Critical Vertex (Q4290097) (← links)
- A new series of dense graphs of high girth (Q4320744) (← links)
- Fractional products of sets (Q4322479) (← links)
- Paul Erdős, 1913-1996 (Q5906850) (← links)
