default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVladimir Nikiforov 0001
Person information
- affiliation: University of Memphis, Department of Mathematical Sciences, TN, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j44]Vladimir Nikiforov:
Turan's theorem implies Stanley's bound. Discuss. Math. Graph Theory 40(2): 601-605 (2020)
2010 – 2019
- 2018
- [j43]Vladimir Nikiforov, Michael Tait, Craig Timmons:
Degenerate Turán Problems for Hereditary Properties. Electron. J. Comb. 25(4): 4 (2018) - 2016
- [j42]Leonardo Silva de Lima
, Vladimir Nikiforov, Carla Silva Oliveira:
The clique number and the smallest Q-eigenvalue of graphs. Discret. Math. 339(6): 1744-1752 (2016) - 2014
- [j41]Vladimir Nikiforov:
Some Extremal Problems for Hereditary Properties of Graphs. Electron. J. Comb. 21(1): 1 (2014) - [j40]Liying Kang, Vladimir Nikiforov:
Extremal Problems for the p-Spectral Radius of Graphs. Electron. J. Comb. 21(3): 3 (2014) - 2012
- [j39]Béla Bollobás, Vladimir Nikiforov:
Degree Powers in Graphs: The Erdős-Stone Theorem. Comb. Probab. Comput. 21(1-2): 89-105 (2012) - 2011
- [j38]Béla Bollobás, Vladimir Nikiforov:
Large joints in graphs. Eur. J. Comb. 32(1): 33-44 (2011) - 2010
- [j37]Vladimir Nikiforov:
Turán's theorem inverted. Discret. Math. 310(1): 125-131 (2010) - [j36]H. Li, Vladimir Nikiforov, Richard H. Schelp:
A new class of Ramsey-Turán problems. Discret. Math. 310(24): 3579-3583 (2010) - [j35]Béla Bollobás, Vladimir Nikiforov:
The number of graphs with large forbidden subgraphs. Eur. J. Comb. 31(8): 1964-1968 (2010)
2000 – 2009
- 2009
- [j34]Vladimir Nikiforov, Cecil C. Rousseau:
Ramsey goodness and beyond. Comb. 29(2): 227-262 (2009) - [j33]Vladimir Nikiforov:
Spectral Saturation: Inverting the Spectral Turán Theorem. Electron. J. Comb. 16(1) (2009) - [j32]Vladimir Nikiforov:
Degree Powers in Graphs with a Forbidden Even Cycle. Electron. J. Comb. 16(1) (2009) - [j31]Vladimir Nikiforov:
A Spectral Erdös-Stone-Bollobás Theorem. Comb. Probab. Comput. 18(3): 455-458 (2009) - [j30]Vladimir Nikiforov:
Complete r-partite subgraphs of dense r-graphs. Discret. Math. 309(13): 4326-4331 (2009) - [j29]Vladimir Nikiforov:
More spectral bounds on the clique and independence numbers. J. Comb. Theory B 99(6): 819-826 (2009) - [j28]Vladimir Nikiforov:
Stability for large forbidden subgraphs. J. Graph Theory 62(4): 362-368 (2009) - 2008
- [j27]Vladimir Nikiforov:
Graphs with Many Copies of a Given Subgraph. Electron. J. Comb. 15(1) (2008) - [j26]Béla Bollobás, Vladimir Nikiforov:
Joints in graphs. Discret. Math. 308(1): 9-19 (2008) - [j25]Béla Bollobás, Vladimir Nikiforov:
Graphs and Hermitian matrices: Exact interlacing. Discret. Math. 308(20): 4816-4821 (2008) - [j24]Vladimir Nikiforov, Richard H. Schelp:
Cycles and stability. J. Comb. Theory B 98(1): 69-84 (2008) - 2007
- [j23]Vladimir Nikiforov:
Revisiting Two Classical Results on Graph Spectra. Electron. J. Comb. 14(1) (2007) - [j22]Vladimir Nikiforov:
The Spectral Radius of Subgraphs of Regular Graphs. Electron. J. Comb. 14(1) (2007) - [j21]Vladimir Nikiforov, Richard H. Schelp:
Making the components of a graph k-connected. Discret. Appl. Math. 155(3): 410-415 (2007) - [j20]Vladimir Nikiforov:
Eigenvalue problems of Nordhaus-Gaddum type. Discret. Math. 307(6): 774-780 (2007) - [j19]Vladimir Nikiforov:
The sum of the squares of degrees: Sharp asymptotics. Discret. Math. 307(24): 3187-3193 (2007) - [j18]Sebastian M. Cioaba, David A. Gregory, Vladimir Nikiforov:
Extreme eigenvalues of nonregular graphs. J. Comb. Theory B 97(3): 483-486 (2007) - [j17]Béla Bollobás, Vladimir Nikiforov:
Cliques and the spectral radius. J. Comb. Theory B 97(5): 859-865 (2007) - 2006
- [j16]Vladimir Nikiforov:
Edge Distribution of Graphs with Few Copies of a Given Graph. Comb. Probab. Comput. 15(6): 895-902 (2006) - [j15]Vladimir Nikiforov:
The smallest eigenvalue of Kr-free graphs. Discret. Math. 306(6): 612-616 (2006) - [j14]Vladimir Nikiforov, Richard H. Schelp:
Cycle lengths in graphs with large minimum degree. J. Graph Theory 52(2): 157-170 (2006) - 2005
- [j13]Béla Bollobás, Vladimir Nikiforov:
The Sum of Degrees in Cliques. Electron. J. Comb. 12 (2005) - [j12]Vladimir Nikiforov:
The Cycle-Complete Graph Ramsey Numbers. Comb. Probab. Comput. 14(3): 349-370 (2005) - [j11]Béla Bollobás, Vladimir Nikiforov:
Books in graphs. Eur. J. Comb. 26(2): 259-270 (2005) - [j10]Vladimir Nikiforov, Cecil C. Rousseau:
A note on Ramsey numbers for books. J. Graph Theory 49(2): 168-176 (2005) - [j9]Vladimir Nikiforov, Cecil C. Rousseau:
Book Ramsey numbers. I. Random Struct. Algorithms 27(3): 379-400 (2005) - 2004
- [j8]Béla Bollobás, Vladimir Nikiforov:
Degree Powers in Graphs with Forbidden Subgraphs. Electron. J. Comb. 11(1) (2004) - [j7]Béla Bollobás, Vladimir Nikiforov:
Hermitian matrices and graphs: singular values and discrepancy. Discret. Math. 285(1-3): 17-32 (2004) - [j6]Béla Bollobás, Vladimir Nikiforov:
Graphs and Hermitian matrices: eigenvalue interlacing. Discret. Math. 289(1-3): 119-127 (2004) - [j5]Vladimir Nikiforov, Cecil C. Rousseau:
Large generalized books are p-good. J. Comb. Theory B 92(1): 85-97 (2004) - [j4]Vladimir Nikiforov, Richard H. Schelp:
Cycles and paths in graphs with large minimal degree. J. Graph Theory 47(1): 39-52 (2004) - 2003
- [j3]Ervin Györi, Vladimir Nikiforov, Richard H. Schelp:
Nearly bipartite graphs. Discret. Math. 272(2-3): 187-196 (2003) - [p1]Béla Bollobás, Vladimir Nikiforov, Nicholas C. Wormald, Ralph J. Faudree, Alan M. Frieze:
Analytic Graph Theory. Handbook of Graph Theory 2003: 787-871 - 2002
- [j2]Vladimir Nikiforov:
Some Inequalities For The Largest Eigenvalue Of A Graph. Comb. Probab. Comput. 11(2): 179-189 (2002) - 2001
- [j1]Vladimir Nikiforov:
On The Edge Distribution Of A Graph. Comb. Probab. Comput. 10(6): 543-555 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
