Some sharp lower bounds for the bipartite Turán number of theta graphs
From MaRDI portal
Publication:6588169
zbMATH Open1545.05107MaRDI QIDQ6588169
Publication date: 15 August 2024
Published in: Bulletin of the Hellenic Mathematical Society (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Cites Work
- Title not available (Why is that?)
- On a class of degenerate extremal graph problems
- Random algebraic construction of extremal graphs
- Graphs with few paths of prescribed length between any two vertices
- Number of Points of Varieties in Finite Fields
- On Turán exponents of bipartite graphs
- Bipartite-ness under smooth conditions
This page was built for publication: Some sharp lower bounds for the bipartite Turán number of theta graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6588169)
